The paper proves that bounded bandwidth implies polylogarithmic BFS width, yielding first deterministic guarantees for Cuthill-McKee and near-linear graph reconstruction.
A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, but solvable in linear time on this type of graphs. The problems are relevant for assessing network reliability and improving the network's performance and fault tolerance. The main technique considered in this paper is dynamic programming.
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
The paper proves that bounded bandwidth implies polylogarithmic BFS width, yielding first deterministic guarantees for Cuthill-McKee and near-linear graph reconstruction.