Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037): 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:59, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Independent domination in finitely defined classes of graphs: polynomial algorithms |
scientific article |
Statements
Independent domination in finitely defined classes of graphs: polynomial algorithms (English)
0 references
6 February 2015
0 references
independent domination
0 references
finitely defined class of graphs
0 references
polynomial-time algorithm
0 references
