Pith. sign in

Title resolution pending

· 1995 · Journal of Computer and System Sciences · DOI 10.1006/jcss.1995.1076 · arXiv 1995.1076

1 Pith paper cite this work, alongside 110 external citations. Polarity classification is still indexing.

1 Pith paper citing it
110 external citations · external index
open at publisher browse 1 citing papers arXiv PDF

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 1

years

2026 1

verdicts

CONDITIONAL 1

representative citing papers

Breadth-First Search in Succinct Planar Graphs

cs.DS · 2026-07-07 · conditional · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Breadth-First Search in Succinct Planar Graphs cs.DS · 2026-07-07 · conditional · none · ref 16

    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.