Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q6167020): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Vertex-edge domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total vertex-edge domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double vertex-edge domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the vertex-edge domination number of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3059032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling automata and programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on vertex-edge and independent vertex-edge domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to domination problems on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest cycle problem is polynomial on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352951 / rank
 
Normal rank

Latest revision as of 16:18, 1 August 2024

scientific article; zbMATH DE number 7708534
Language Label Description Also known as
English
Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
scientific article; zbMATH DE number 7708534

    Statements

    Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (English)
    0 references
    0 references
    0 references
    7 July 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    vertex-edge domination
    0 references
    double vertex-edge domination
    0 references
    \(k\)-vertex-edge domination
    0 references
    polynomial-time algorithm
    0 references
    interval graphs
    0 references