Compact representation of graphs of small clique-width
From MaRDI portal
Recommendations
- Compact representation of graphs with bounded bandwidth or treedepth
- scientific article; zbMATH DE number 2079399
- scientific article; zbMATH DE number 2170436
- Clique-width for graph classes closed under complementation
- scientific article; zbMATH DE number 7204407
- Compact grid representation of graphs
- scientific article; zbMATH DE number 1262796
- On the succinct representation of graphs
- Clique-width of countable graphs: a compactness property
- The relative clique-width of a graph
Cites work
- scientific article; zbMATH DE number 2079399 (Why is no real title available?)
- scientific article; zbMATH DE number 756768 (Why is no real title available?)
- A uniform paradigm to succinctly encode various families of trees
- Alphabet partitioning for compressed rank/select and applications
- Clique-width of partner-limited graphs
- Compact navigation and distance oracles for graphs with small treewidth
- Compact representation of posets
- Efficient graph representations
- Fully functional static and dynamic succinct trees
- Linear time solvable optimization problems on graphs of bounded clique-width
- On the OBDD size for graphs of bounded tree- and clique-width
- On the Relationship Between Clique-Width and Treewidth
- On the clique-width of some perfect graph classes
- Query efficient implementation of graphs of bounded clique-width
- Rank/select operations on large alphabets
- Recent developments on graphs of bounded clique-width
- Succinct posets
- Succinct representation of labeled graphs
- Succinct representations of separable graphs
- Upper bounds to the clique width of graphs
Cited in
(8)- Compact navigation and distance oracles for graphs with small treewidth
- An adjacency labeling scheme based on a decomposition of trees into caterpillars
- Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
- Compact representation of graphs with bounded bandwidth or treedepth
- Optimal centrality computations within bounded clique-width graphs
- Succinct data structures for bounded clique-width graphs
- Compact navigation and distance oracles for graphs with small treewidth
- Optimal centrality computations within bounded clique-width graphs
This page was built for publication: Compact representation of graphs of small clique-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724221)
