Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:11, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the path cover problem on circular-arc graphs by using an approximation algorithm |
scientific article |
Statements
Solving the path cover problem on circular-arc graphs by using an approximation algorithm (English)
0 references
10 January 2006
0 references
Graph algorithms
0 references
Path cover
0 references
Hamiltonian cycle
0 references
Hamiltonian path
0 references
Interval graphs
0 references
Circular-arc graphs
0 references
