Succinct representation of labeled graphs
DOI10.1007/S00453-010-9452-7zbMATH Open1239.05125OpenAlexW2070346129MaRDI QIDQ2428673FDOQ2428673
Authors: Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro 
Publication date: 26 April 2012
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00712915/file/SuccinctLabeledGraphs_Algorithmica_Hal.pdf
Recommendations
graphdata structuresplanar graphsuccinct data structuresbook embeddingplanar triangulation\(k\)-page graph
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Graph representations (geometric and intersection representations, etc.) (05C62) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Succinct representation of balanced parentheses and static trees
- Balanced parentheses strike back
- Representing trees of higher degree
- A Separator Theorem for Planar Graphs
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- The book thickness of a graph
- Title not available (Why is that?)
- Embedding planar graphs in four pages
- Succinct indexes for strings, binary relations and multi-labeled trees
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Sorting Using Networks of Queues and Stacks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Succinct Representations of Arbitrary Graphs
- Title not available (Why is that?)
- Automata, Languages and Programming
- Orderly Spanning Trees with Applications
- Algorithms and Data Structures
- A Compact Encoding of Plane Triangulations with Efficient Query Supports
- Succinct representations of planar maps
- Ultra-succinct representation of ordered trees
- Succinct Ordinal Trees Based on Tree Covering
- Succinct Representation of Labeled Graphs
- Title not available (Why is that?)
Cited In (20)
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- A note on succinct representations of graphs
- On the succinct representation of equivalence classes
- Succinct data structures for representing equivalence classes
- Succinct representations of separable graphs
- Space-efficient vertex separators for treewidth
- Compact representation of graphs of small clique-width
- On the succinct representation of graphs
- Succinct data structure for path graphs
- Sorting and ranking of self-delimiting numbers with applications to tree isomorphism
- Title not available (Why is that?)
- Compact binary relation representations with rich functionality
- Compact navigation and distance oracles for graphs with small treewidth
- Succinct and Implicit Data Structures for Computational Geometry
- A succinct data structure for self-indexing ternary relations
- Succinct data structures for families of interval graphs
- Succinct Representation of Labeled Graphs
- Dynamic compact planar embeddings
- Navigating planar topologies in near-optimal space and time
- Space efficient data structures for dynamic orthogonal range counting
This page was built for publication: Succinct representation of labeled graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2428673)
