Directed Planar Reachability is in Unambiguous Log-Space

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) Pub Date : 2007-06-13 DOI:10.1145/1490270.1490274

Chris Bourke, Raghunath Tewari, N. V. Vinodchandran

引用次数: 76

Abstract

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

查看原文本刊更多论文

无二义对数空间中的有向平面可达性

我们证明了有向平面图的st-连通性问题可以在无二义对数空间中确定。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

自引率

0.00%

发文量