On the complexity of the Eulerian closed walk with precedence path constraints problem (Q2861508)
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: On the complexity of the Eulerian closed walk with precedence path constraints problem |
scientific article; zbMATH DE number 6224277
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the Eulerian closed walk with precedence path constraints problem |
scientific article; zbMATH DE number 6224277 |
Statements
8 November 2013
0 references
0 references
1.0000002
0 references
0.84725046
0 references
0.84201384
0 references
0.84074533
0 references
0.8381965
0 references
0 references
0.8332828
0 references
On the complexity of the Eulerian closed walk with precedence path constraints problem (English)
0 references
