Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space
Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-03409-1_29
Full Text
Open PDFAbstract
Available in full text
Date
January 1, 2009
Authors
Publisher
Springer Berlin Heidelberg