A linear time algorithm to compute a dominating path in an AT-free graph (Q673002): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:21, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm to compute a dominating path in an AT-free graph |
scientific article |
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
