Domination in distance-hereditary graphs (Q5957300): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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: Labeling algorithms for domination problems in sun-free chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the domination number of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-Hereditary Graphs, Steiner Trees, and Connected Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bibliography on domination in graphs and some basic definitions of domination parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge domination problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination and transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Algorithmic Complexity of Total Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3870917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogeneous sets and domination: A linear time algorithm for distance?hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>R</i> -Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted connected domination and Steiner trees in distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:34, 3 June 2024

scientific article; zbMATH DE number 1716682
Language Label Description Also known as
English
Domination in distance-hereditary graphs
scientific article; zbMATH DE number 1716682

    Statements

    Domination in distance-hereditary graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 August 2002
    0 references
    A linear time algorithm for the domination problem on distance-hereditary graphs is given.
    0 references
    domination
    0 references
    distance-hereditary graphs
    0 references
    linear time algorithm
    0 references

    Identifiers