The paper proves that bounded bandwidth implies polylogarithmic BFS width, yielding first deterministic guarantees for Cuthill-McKee and near-linear graph reconstruction.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.