Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search

DOI10.1007/978-3-642-10217-2_17zbMath1267.05251OpenAlexW1608992704MaRDI QIDQ3651542

Christophe Crespelle, Philippe Gambette

Publication date: 11 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_17

zbMATH Keywords

interval graphspermutation graphsspace representations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Linearity is strictly more powerful than contiguity for encoding graphs ⋮ Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs ⋮ (Nearly-)tight bounds on the contiguity and linearity of cographs

This page was built for publication: Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search