𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs

✍ Scribed by Lars Døvling Andersen; Herbert Fleischner


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
821 KB
Volume
59
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES