Spanning tree congestion of proper interval graphs
Abstract
We show that the spanning tree congestion problem is NP-complete even for proper interval graphs of linear clique-width at most 4.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.