Login / Signup
The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs.
Lars Døvling Andersen
Herbert Fleischner
Published in:
Discret. Appl. Math. (1995)
Keyphrases
</>
spanning tree
edge disjoint
random walk
minimum cost