Minimum node disjoint path covering for circular-arc graphs (Q1257337): 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/0020-0190(79)90011-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1963840573 / rank | |||
Normal rank | |||
Revision as of 20:04, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum node disjoint path covering for circular-arc graphs |
scientific article |
Statements
Minimum node disjoint path covering for circular-arc graphs (English)
0 references
1979
0 references
Circular-Arcgraphs
0 references
Node Disjoint Path Cover
0 references
Time Complexity
0 references
Np- Complete
0 references
Hamiltonian Path Problem
0 references
