On the complexity of the Eulerian closed walk with precedence path constraints problem (Q441867)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the Eulerian closed walk with precedence path constraints problem |
scientific article |
Statements
On the complexity of the Eulerian closed walk with precedence path constraints problem (English)
0 references
8 August 2012
0 references
Eulerian closed walk
0 references
precedence path constraints
0 references
NP-completeness
0 references
polynomial-time algorithm
0 references
0 references
