NP-completeness of the Eulerian walk problem for a multiple graph (Q6495489)
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: NP-completeness of the Eulerian walk problem for a multiple graph |
scientific article; zbMATH DE number 7841151
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness of the Eulerian walk problem for a multiple graph |
scientific article; zbMATH DE number 7841151 |
Statements
NP-completeness of the Eulerian walk problem for a multiple graph (English)
0 references
30 April 2024
0 references
multiple graph
0 references
multiple path
0 references
divisible graph
0 references
covering trails
0 references
edge-disjoint paths
0 references
Eulerian trail
0 references
Eulerian cycle
0 references
NP-completeness
0 references
0.8010252118110657
0 references
0.7575969099998474
0 references
0.7520747184753418
0 references
0.7512271404266357
0 references
0.742527961730957
0 references
