#relentlessly realistic quantum interest : Finding Simple Paths on Graphs with Must Visit Nodes

I am interested in solving this problem of finding simple paths on large graphs (with 100 - 1000 nodes) with the constraint that all paths must pass through certain N number of nodes. The solution to this problem has practical applications in domains such as supply chain, software testing, network design etc. 

1

Comments

2 comments

Please sign in to leave a comment.

Didn't find what you were looking for?

New post