• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones.

Robert JanczewskiKrzysztof Turowski
Published in: Inf. Process. Lett. (2015)
Keyphrases