Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2005.07.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2036803675 / rank | |||
Normal rank | |||
Revision as of 20:41, 19 March 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
