Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561)
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: Solving the path cover problem on circular-arc graphs by using an approximation algorithm |
scientific article; zbMATH DE number 2244813
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the path cover problem on circular-arc graphs by using an approximation algorithm |
scientific article; zbMATH DE number 2244813 |
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
0 references
0 references
0.8383022546768188
0 references
0.7898814082145691
0 references
0.7891585826873779
0 references
0.7816727757453918
0 references
0.7812849283218384
0 references
