Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Eulerian disjoint paths problem in grid graphs is NP-complete."

Dániel Marx (2004)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2003.12.003

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/Marx04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Marx04
Dániel Marx:
Eulerian disjoint paths problem in grid graphs is NP-complete. Discret. Appl. Math. 143(1-3): 336-341 (2004)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.