Eulerian disjoint paths problem in grid graphs is NP-complete (Q1887070)
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: Eulerian disjoint paths problem in grid graphs is NP-complete |
scientific article; zbMATH DE number 2118353
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Eulerian disjoint paths problem in grid graphs is NP-complete |
scientific article; zbMATH DE number 2118353 |
Statements
Eulerian disjoint paths problem in grid graphs is NP-complete (English)
0 references
23 November 2004
0 references
Disjoint paths
0 references
Grids
0 references
NP-completeness
0 references
