Succinct data structures for bounded clique-width graphs

DOI10.1016/J.DAM.2024.03.016MaRDI QIDQ6497944

Srinivasa Rao Satti, Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane

Publication date: 6 May 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

cographsdistance hereditary graphssuccinct data structuresbounded clique-width graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Data structures (68P05)

Related Items (1)

Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Succinct encoding of arbitrary graphs
• Compact representation of graphs of small clique-width
• Completely separable graphs
• Succinct representations of planar maps
• Recent developments on graphs of bounded clique-width
• Edge dominating set and colorings on graphs with fixed clique-width
• Powers of distance-hereditary graphs
• Linear time solvable optimization problems on graphs of bounded clique-width
• Upper bounds to the clique width of graphs
• Succinct navigational oracles for families of intersection graphs on a circle
• Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs
• Succinct representations for (non)deterministic finite automata
• A uniform paradigm to succinctly encode various families of trees
• Approximating clique-width and branch-width
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Succinct encodings for families of interval graphs
• Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
• Succinct permutation graphs
• Succinct Representation of Balanced Parentheses and Static Trees
• BOUNDING THE NUMBER OF REDUCED TREES, COGRAPHS, AND SERIES-PARALLEL GRAPHS BY COMPRESSION
• A SAT Approach to Clique-Width
• The monadic second-order logic of graphs, II: Infinite graphs of bounded width
• Clique-Width is NP-Complete
• Succinct Representations of Separable Graphs
• An Exact Enumeration of Distance-Hereditary Graphs
• ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
• Algorithms and Data Structures
• A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs
• Graph-Theoretic Concepts in Computer Science
• Space-Efficient Data Structures for Lattices

This page was built for publication: Succinct data structures for bounded clique-width graphs