Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653)
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 algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.862412691116333
0 references
0.8485433459281921
0 references
0.8402071595191956
0 references
0.8308693170547485
0 references
0.8297871947288513
0 references
