A linear time algorithm to compute a dominating path in an AT-free graph (Q673002)
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: A linear time algorithm to compute a dominating path in an AT-free graph |
scientific article; zbMATH DE number 985319
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm to compute a dominating path in an AT-free graph |
scientific article; zbMATH DE number 985319 |
Statements
A linear time algorithm to compute a dominating path in an AT-free graph (English)
0 references
28 February 1997
0 references
Asteroidal triple-free graphs
0 references
Domination
0 references
Algorithms
0 references
0.919076442718506
0 references
0.9062354564666748
0 references
0.9001926183700562
0 references
0.8737790584564209
0 references
