Succinct data structures for families of interval graphs

DOI10.1007/978-3-030-24766-9_1zbMath1453.68060arXiv1902.09228OpenAlexW2964624700MaRDI QIDQ2285077

Sankardeep Chakraborty, Hüseyin Acan, Srinivasa Rao Satti, Seungbum Jo

Publication date: 16 January 2020

Full work available at URL: https://arxiv.org/abs/1902.09228

zbMATH Keywords

interval graphssuccinct encodingspace-efficient data structures

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (9)

Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs ⋮ Succinct encodings for families of interval graphs ⋮ Succinct data structure for path graphs ⋮ Unnamed Item ⋮ Succinct representations for (non)deterministic finite automata ⋮ Frameworks for designing in-place graph algorithms ⋮ Unnamed Item ⋮ Succinct navigational oracles for families of intersection graphs on a circle ⋮ Succinct representation for (non)deterministic finite automata

This page was built for publication: Succinct data structures for families of interval graphs