A succinct encoding of planar graphs supports BFS in O(n) time with o(n) extra bits, keeps the BFS tree queryable, and yields sublinear-space planar separator and bipartiteness algorithms.
Space-efficient depth-first search via augmented succinct graph encodings
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Breadth-First Search in Succinct Planar Graphs
A succinct encoding of planar graphs supports BFS in O(n) time with o(n) extra bits, keeps the BFS tree queryable, and yields sublinear-space planar separator and bipartiteness algorithms.