I have a DAG that admits many possible topological sorts. I want to construct one that has the minimum maximum distance between a node and its neighbours in an array storing the nodes in sorted order.

Does this problem have a name that I can search (minimum maximum distance topological sort didn't turn up anything)?

(If the problem is NP-hard, a good heuristic will do too.)


1 Answer 1


The measure you are trying to minimize is called (directed) bandwidth. Finding a minimum directed bandwidth ordering is NP-hard.

  • $\begingroup$ Thanks! That's a huge help! $\endgroup$
    – dpdp
    Commented Sep 13, 2021 at 14:11

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.