Directed Planar Reachability is in Unambiguous Log-Space

San Diego, California June 13-March 16

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/CCC.2007.9

Twenty-Second Annual IEEE Conference ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Chris Bourke Articles by Raghunath Tewari Articles by N.V. Vinodchandran

	ASCII Text	x
	Chris Bourke, Raghunath Tewari, N.V. Vinodchandran, "Directed Planar Reachability is in Unambiguous Log-Space," Computational Complexity, Annual IEEE Conference on, pp. 217-221, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007.

	BibTex	x
	@article{ 10.1109/CCC.2007.9, author = {Chris Bourke and Raghunath Tewari and N.V. Vinodchandran}, title = {Directed Planar Reachability is in Unambiguous Log-Space}, journal ={Computational Complexity, Annual IEEE Conference on}, volume = {0}, year = {2007}, issn = {1093-0159}, pages = {217-221}, doi = {http://doi.ieeecomputersociety.org/10.1109/CCC.2007.9}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computational Complexity, Annual IEEE Conference on TI - Directed Planar Reachability is in Unambiguous Log-Space SN - 1093-0159 SP217 EP221 A1 - Chris Bourke, A1 - Raghunath Tewari, A1 - N.V. Vinodchandran, PY - 2007 KW - null VL - 0 JA - Computational Complexity, Annual IEEE Conference on ER -

Chris Bourke, University of Nebraska, Lincoln, USA

Raghunath Tewari, University of Nebraska, Lincoln, USA

N.V. Vinodchandran, University of Nebraska, Lincoln, USA

We show that the st-connectivity problem for directed planar graphs can be decided in unambiguous logarithmic space.

Citation:

Chris Bourke, Raghunath Tewari, N.V. Vinodchandran, "Directed Planar Reachability is in Unambiguous Log-Space," ccc, pp.217-221, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.