Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q6167020): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:53, 10 July 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
7 July 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
