Planar $k$-path in subexponential time and polynomial space

Publikationstyp
Conference Paper
Date Issued
2011
Sprache
English
Author(s)
Lokshtanov, Daniel  
Mnich, Matthias  
Saurabh, Saket  
TORE-URI
http://hdl.handle.net/11420/4553
Start Page
262
End Page
270
Citation
International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011)
Contribution to Conference
37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011  
Publisher DOI
10.1007/978-3-642-25870-1_24
Publisher
Springer Nature