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$?
Order the nodes of a directed graph
1
$\begingroup$
algorithms
graph-theory
-
1That's an NP-complete problem, even for the undirected case, called *Bandwidth*. – 2011-11-21