Spanning tree congestion of proper interval graphs
Yota Otachi
TL;DR
This paper proves that determining the spanning tree congestion is NP-complete even for a restricted class of graphs called proper interval graphs with low clique-width, highlighting computational complexity challenges.
Contribution
It establishes the NP-completeness of the spanning tree congestion problem for proper interval graphs with linear clique-width at most 4.
Findings
Spanning tree congestion problem is NP-complete for proper interval graphs.
NP-completeness holds even for graphs with linear clique-width ≤ 4.
Abstract
We show that the spanning tree congestion problem is NP-complete even for proper interval graphs of linear clique-width at most 4.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Advanced Graph Theory Research · Interconnection Networks and Systems