Andersen Lars Dvling

Lars Dvling Andersen

Information about the author Lars Dvling Andersen will soon be added to the site.
Found 1 papers in total
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: