Succinct data structures for bounded clique-width graphs (Q6497944): Difference between revisions

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

Latest revision as of 14:25, 3 December 2024

scientific article; zbMATH DE number 7843504
Language Label Description Also known as
English
Succinct data structures for bounded clique-width graphs
scientific article; zbMATH DE number 7843504

    Statements

    Succinct data structures for bounded clique-width graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 May 2024
    0 references
    succinct data structures
    0 references
    bounded clique-width graphs
    0 references
    cographs
    0 references
    distance hereditary graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references