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.
11 Kentaro Sumigawa and Kunihiko Sadakane
2 Pith papers cite this work, alongside 378 external citations. Polarity classification is still indexing.
2
Pith papers citing it
378
external citations · external index
fields
cs.DS 2representative citing papers
Introduces efficient algorithms for range mode queries (especially small max frequency) and range mode enumeration with query time linear in output size plus small terms.
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.
-
Enumerating Range Modes
Introduces efficient algorithms for range mode queries (especially small max frequency) and range mode enumeration with query time linear in output size plus small terms.