Succinct encodings for families of interval graphs
From MaRDI portal
Publication:2661990
Recommendations
- Succinct data structures for families of interval graphs
- Succinct encoding of arbitrary graphs
- On interval representations of graphs
- Bounded-depth succinct encodings and the structure they imply on graphs
- Succinct Representations of Arbitrary Graphs
- Succinct representations of separable graphs
- A note on succinct representations of graphs
- On the succinct representation of graphs
- Succinct Encodings of Graph Isomorphism
- Efficient enumeration of non-isomorphic interval graphs
Cites work
- scientific article; zbMATH DE number 2018401 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 871936 (Why is no real title available?)
- scientific article; zbMATH DE number 7561421 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- A framework for in-place graph algorithms
- A unified approach to approximating resource allocation and scheduling
- Algorithmic graph theory and perfect graphs
- AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
- Compact navigation and distance oracles for graphs with small treewidth
- Complexity and algorithms for reasoning about time
- Counting Interval Graphs
- Efficient algorithms for interval graphs and circular-arc graphs
- Indexing graph search trees and applications
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
- Intersection graphs of halflines and halfplanes
- Interval graphs and related topics
- Introduction to algorithms.
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Linear-time recognition of circular-arc graphs
- On space efficient two dimensional range minimum data structures
- On the classes of interval graphs of limited nesting and count of lengths
- On the enumeration of interval graphs
- Rank/select operations on large alphabets
- Solving the all-pair shortest path query problem on interval and circular-arc graphs
- Space efficient linear time algorithms for BFS, DFS and applications
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Stability in circular arc graphs
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Succinct data structures for families of interval graphs
- Succinct data structures for flexible text retrieval systems
- Succinct encoding of arbitrary graphs
- Succinct indexes for strings, binary relations and multilabeled trees
- Succinct representation of balanced parentheses and static trees
- Succinct representations of permutations and functions
- Succinct representations of planar maps
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The Complexity of Coloring Circular Arcs and Chords
- Wavelet trees for all
Cited in
(15)- Distance queries over dynamic interval graphs
- Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
- Succinct encoding of arbitrary graphs
- Efficient neighborhood encoding for interval graphs and permutation graphs and O(n) breadth-first search
- Shorter Labeling Schemes for Planar Graphs
- Succinct Representations of Arbitrary Graphs
- Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
- Succinct data structure for chordal graphs with bounded vertex leafage
- Compact representation of graphs with bounded bandwidth or treedepth
- Succinct data structures for bounded clique-width graphs
- Succinct permutation graphs
- Succinct data structures for families of interval graphs
- Enumeration of interval graphs and d-representable complexes
- Distance queries over dynamic interval graphs
- Succinct navigational oracles for families of intersection graphs on a circle
This page was built for publication: Succinct encodings for families of interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2661990)
