On the succinct representation of graphs
From MaRDI portal
Publication:800734
DOI10.1016/0166-218X(84)90126-4zbMATH Open0551.68059WikidataQ56209828 ScholiaQ56209828MaRDI QIDQ800734FDOQ800734
Authors: Gy. Turán 
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- A note on succinct representations of graphs
- Succinct representations of graphs
- Succinct Representations of Arbitrary Graphs
- Succinct representations of separable graphs
- Succinct representation of labeled graphs
- Succinct Representation of Labeled Graphs
- scientific article; zbMATH DE number 219271
- Succinct encoding of arbitrary graphs
- The complexity of searching succinctly represented graphs
- scientific article; zbMATH DE number 4110112
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
Cited In (47)
- Succinct Encodings of Graph Isomorphism
- Title not available (Why is that?)
- Simple planar graph partition into three forests
- Bounding the number of reduced trees, cographs, and series-parallel graphs by compression
- Trading uninitialized space for time
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding
- A compact encoding of plane triangulations with efficient query supports
- A Compact Encoding of Plane Triangulations with Efficient Query Supports
- Quick encoding of plane graphs in \(\log _{2}14\) bits per edge
- A note on succinct representations of graphs
- Finite presentation of homogeneous graphs, posets and Ramsey classes
- Linearity is strictly more powerful than contiguity for encoding graphs
- Linearity is strictly more powerful than contiguity for encoding graphs
- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
- Space-efficient planar acyclicity constraints. A declarative pearl
- (Nearly-)tight bounds on the contiguity and linearity of cographs
- Succinct representations of planar maps
- Compact representations of spatial hierarchical structures with support for topological queries
- Title not available (Why is that?)
- Succinct representation of general unlabeled graphs
- Succinct representations of separable graphs
- Short encodings of planar graphs and maps
- Title not available (Why is that?)
- Compact representation of graphs of small clique-width
- A Census of Plane Graphs with Polyline Edges
- A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
- Succinct representation of labeled graphs
- The saga of minimum spanning trees
- Graph compression by BFS
- Short Encodings of Evolving Structures
- Succinct encodings for families of interval graphs
- Succinct encoding of arbitrary graphs
- Representing graphs implicitly using almost optimal space
- Compact navigation and distance oracles for graphs with small treewidth
- Planar graphs, via well-orderly maps and trees
- Succinct encoding of binary strings representing triangulations
- Asymptotic enumeration and limit laws of planar graphs
- Bounding the number of reduced trees, cographs, and series-parallel graphs by compression
- Succinct Representations of Arbitrary Graphs
- Efficient local representations of graphs
- A clique-difference encoding scheme for labelled \(k\)-path graphs
- Implementing the topological model succinctly
- Succinct Representation of Labeled Graphs
- Dynamic compact planar embeddings
- Title not available (Why is that?)
- An edgebreaker-based efficient compression scheme for regular meshes
- Navigating planar topologies in near-optimal space and time
This page was built for publication: On the succinct representation of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800734)
