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$?
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
4 years ago