Homogeneous sets and domination: A linear time algorithm for distance?hereditary graphs (Q2719843): 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: Dually Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogeneously orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: r-domination problems on homogeneously orderable 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: Total domination and transformation / rank
 
Normal rank

Latest revision as of 16:41, 3 June 2024

scientific article
Language Label Description Also known as
English
Homogeneous sets and domination: A linear time algorithm for distance?hereditary graphs
scientific article

    Statements

    Homogeneous sets and domination: A linear time algorithm for distance?hereditary graphs (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2001
    0 references
    graph algorithms
    0 references
    domination
    0 references
    modular decomposition
    0 references
    distance-hereditary graphs
    0 references
    dominating set
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references