Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs (Q3569078)
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 5723183
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs |
scientific article; zbMATH DE number 5723183 |
Statements
Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs (English)
0 references
17 June 2010
0 references
arc-colored digraphs
0 references
properly arc-colored paths/trails and circuits
0 references
Hamiltonian directed path
0 references
arc-colored tournaments
0 references
polynomial algorithms
0 references
NP-completeness
0 references
0.9987167
0 references
0.9018079
0 references
0.8950568
0 references
0.89156014
0 references
0.8904927
0 references
0.8904927
0 references
0.88802755
0 references
0.8880274
0 references
