Succinct data structures for chordal graphs
From MaRDI portal
Recommendations
Cites work
- A characterisation of rigid circuit graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Approximate distance oracle in \(O(n ^{2})\) time and \(O(n)\) space for chordal graphs
- Compact navigation and distance oracles for graphs with small treewidth
- Counting labelled chordal graphs
- Degrees of acyclicity for hypergraphs and relational database schemes
- Fast set intersection and two-patterns matching
- Fully dynamic algorithms for chordal graphs and split graphs
- Fully functional static and dynamic succinct trees
- scientific article; zbMATH DE number 2079399 (Why is no real title available?)
- Maintaining chordal graphs dynamically: improved upper and lower bounds
- Minimum \(k\)-path vertex cover
- Programming Languages and Systems
- Representations of chordal graphs as subtrees of a tree
- Succinct encoding of arbitrary graphs
- Triangulated graphs and the elimination process
Cited in
(17)- Wheeler graphs: a framework for BWT-based data structures
- Succinct navigational oracles for families of intersection graphs on a circle
- Succinct representation for (non)deterministic finite automata
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs
- Frameworks for designing in-place graph algorithms
- Succinct encodings for families of interval graphs
- Succinct permutation graphs
- scientific article; zbMATH DE number 7765383 (Why is no real title available?)
- Succinct data structure for path graphs
- Succinct data structures for bounded clique-width graphs
- Distance queries over dynamic interval graphs
- Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
- Closing the gap: minimum space optimal time distance labeling scheme for interval graphs
- Succinct data structure for chordal graphs with bounded vertex leafage
- Distance queries over dynamic interval graphs
- Succinct preferential-attachment graphs
- Succinct data structures for chordal graph with bounded leafage or vertex leafage
This page was built for publication: Succinct data structures for chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091062)
