Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding ..."

Lars Døvling Andersen, Herbert Fleischner (1995)

> Home

Details and statistics

DOI: 10.1016/0166-218X(95)80001-K

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/AndersenF95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/AndersenF95
Lars Døvling Andersen, Herbert Fleischner:
The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs. Discret. Appl. Math. 59(3): 203-214 (1995)

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.