2 votes
Accepted

Getting all vertices with fixed index in their topological ordering of a DAG

In my discussion, I will assume that the $|V|$ vertices of the DAG are represented as integers $0,1,..., |V|-1$ so they can be used as indices of an array. In case, different "labeling" is ...
  • 1,679
1 vote

Finding optimal paths for multiple agents

The problem is NP-hard: the special case of $N=1$ is the traveling salesman problem. Therefore, you can't expect any efficient algorithm that will always work. A reasonable approach in practice is to ...
  • 147k

Only top scored, non community-wiki answers of a minimum length are eligible