1
$\begingroup$

Given a directed graph $G$ and a number $k$, how can I order the nodes (let's say in an array) so that the distance between each two connected nodes is less than or equal to $k$?

  • 1
    That's an NP-complete problem, even for the undirected case, called *Bandwidth*.2011-11-21

0 Answers 0