Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q2111523)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs |
scientific article; zbMATH DE number 7642701
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs |
scientific article; zbMATH DE number 7642701 |
Statements
Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (English)
0 references
17 January 2023
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
