Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Herbert Fleischner
Information about the author Herbert Fleischner will soon be added to the site.
Found
1 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
The NP-completeness of finding A-trials in Eulerian graphs and of finding spanning trees in hypergraphs
1995
Samuel W. Bent and Udi Manber have shown that it is NP-complete to decide whether a...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
