Technology Category
Constraint Satisfaction and Optimization: Distributed CSP/OptimizationKnowledge Representation and Reasoning: Computational Complexity of ReasoningPlanning, Routing, and Scheduling: Optimization of Spatio-temporal Systems
Spanning tree congestion of proper interval graphs
🤖 AI Summary
This study investigates the computational complexity of the spanning tree congestion problem on proper interval graphs. By leveraging structural properties of proper interval graphs together with the constraint that their linear clique-width is at most 4, the authors construct a polynomial-time reduction to establish, for the first time, that the problem remains NP-complete even when restricted to proper interval graphs of clique-width at most 4. This result demonstrates that the spanning tree congestion problem retains intrinsic intractability even within highly structured graph classes, thereby establishing a new lower bound on its parameterized complexity and providing crucial theoretical insight into the problem’s computational hardness.
Technology Category
Application Category
📝 Abstract
We show that the spanning tree congestion problem is NP-complete even for proper interval graphs of linear clique-width at most 4.
Problem
Research questions and friction points this paper is trying to address.
spanning tree congestion
proper interval graphs
NP-complete
clique-width
Innovation
Methods, ideas, or system contributions that make the work stand out.
spanning tree congestion
proper interval graphs
NP-completeness
linear clique-width
🔎 Similar Papers
No similar papers found.
