Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2014.09.024 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2014.09.024 / rank | |||
Normal rank | |||
Latest revision as of 18:41, 9 December 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
0 references
0 references
0 references
