Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs
From MaRDI portal
Publication:3449818
DOI10.1007/978-3-319-21840-3_18zbMath1444.05136arXiv1803.05414OpenAlexW2408185282MaRDI QIDQ3449818
Tien-Nam Le, Christophe Crespelle, Kévin Perrot, Thi Ha Duong Phan
Publication date: 30 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.05414
Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- (Nearly-)tight bounds on the contiguity and linearity of cographs
- On the succinct representation of graphs
- Complement reducible graphs
- Graph compression by BFS
- Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices
- Graph minor theory
- Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search
- The Compactness of Interval Routing
- Permuting Web and Social Graphs
- Codes for the World Wide Web
This page was built for publication: Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs
