Minimum node disjoint path covering for circular-arc graphs (Q1257337)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3630220
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum node disjoint path covering for circular-arc graphs |
scientific article; zbMATH DE number 3630220 |
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
0 references
