Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way (Q3010409): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes between parity and distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extension of bipartite to parity graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with bounded induced distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks with small stretch number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact-port routing models and applications to distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing circle graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Distance Hereditary Graphs Using Split Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width of graphs defined by one-vertex extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving some NP-complete problems using split decomposition / rank
 
Normal rank

Latest revision as of 06:45, 4 July 2024

scientific article
Language Label Description Also known as
English
Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way
scientific article

    Statements

    Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way (English)
    0 references
    0 references
    1 July 2011
    0 references
    distance-hereditary graphs
    0 references
    stretch number
    0 references
    split decomposition
    0 references
    graph algorithms
    0 references
    recognition problem
    0 references

    Identifiers