Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:48, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs |
scientific article |
Statements
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (English)
0 references
9 December 2014
0 references
graph algorithms
0 references
efficient domination
0 references
weighted efficient domination
0 references
dually chordal graph
0 references
AT-free graph
0 references
