Compact representation of graphs of small clique-width
From MaRDI portal
Publication:724221
DOI10.1007/s00453-017-0365-6zbMath1392.68154OpenAlexW2750884281MaRDI QIDQ724221
Publication date: 25 July 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-017-0365-6
Related Items (3)
An adjacency labeling scheme based on a decomposition of trees into caterpillars ⋮ Compact representation of graphs with bounded bandwidth or treedepth ⋮ Optimal centrality computations within bounded clique-width graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Succinct posets
- Compact navigation and distance oracles for graphs with small treewidth
- Recent developments on graphs of bounded clique-width
- On the OBDD size for graphs of bounded tree- and clique-width
- Efficient graph representations
- Query efficient implementation of graphs of bounded clique-width
- Clique-width of partner-limited graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Succinct representation of labeled graphs
- A uniform paradigm to succinctly encode various families of trees
- Fully Functional Static and Dynamic Succinct Trees
- Alphabet Partitioning for Compressed Rank/Select and Applications
- Compact Representation of Posets
- Succinct Representations of Separable Graphs
- Rank/select operations on large alphabets
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- On the Relationship Between Clique-Width and Treewidth
This page was built for publication: Compact representation of graphs of small clique-width