Pith. sign in

Depth-first search using O(n) bits

Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara · 2014 · Lecture notes in computer science · DOI 10.1007/978-3-319-13075-0_44

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

1 Pith paper citing it
29 external citations · OpenAlex
open at publisher browse 1 citing papers

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 3

    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.