Succinct Representation of Labeled Graphs
From MaRDI portal
Recommendations
Cites work
- Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
- Algorithms and Data Structures
- Balanced parentheses strike back
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 5506222 (Why is no real title available?)
- scientific article; zbMATH DE number 4043769 (Why is no real title available?)
- Orderly spanning trees with applications to graph encoding and graph drawing
- Representing trees of higher degree
- Sorting Using Networks of Queues and Stacks
- Succinct indexes for strings, binary relations and multi-labeled trees
- Succinct representation of balanced parentheses and static trees
- The book thickness of a graph
Cited in
(13)- On the succinct representation of equivalence classes
- Succinct representation of labeled graphs
- Succinct encoding of binary strings representing triangulations
- Succinct data structures for representing equivalence classes
- Compact navigation and distance oracles for graphs with small treewidth
- scientific article; zbMATH DE number 2079399 (Why is no real title available?)
- A note on succinct representations of graphs
- Succinct representation of labeled trees
- Indexing graph search trees and applications
- I/O-efficient path traversal in succinct planar graphs
- Short Labels by Traversal and Jumping
- On the succinct representation of graphs
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding
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 Q5387767)