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.
Addison-Wesley
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
CONDITIONAL 2roles
background 1polarities
background 1representative citing papers
Local goal support in policy functional graphs predicts goal failure in sparse GCRL with F1 0.925, and a taxonomy explains residual failures from competing attractors.
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.
-
Functional Graphs for Predicting and Explaining Goal Failure in Sparse Goal-Conditioned RL
Local goal support in policy functional graphs predicts goal failure in sparse GCRL with F1 0.925, and a taxonomy explains residual failures from competing attractors.