Results 1 
2 of
2
The Complexity of Planarity Testing
, 2000
"... We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely conjectured that L = SL [25]. The upper bound of SL matches the lower bound of L in the context of (nonuniform) circ ..."
Abstract

Cited by 25 (8 self)
 Add to MetaCart
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely conjectured that L = SL [25]. The upper bound of SL matches the lower bound of L in the context of (nonuniform) circuit complexity, since L/poly is equal to SL/poly. Similarly, we show that a planar embedding, when one exists, can be found in FL SL . Previously, these problems were known to reside in the complexity class AC 1 , via a O(log n) time CRCW PRAM algorithm [22], although planarity checking for degreethree graphs had been shown to be in SL [23, 20].
A new NCalgorithm for finding a perfect matching in bipartite planar and small genus graphs (Extended Abstract)
, 2000
"... It has been known for a long time now that the problem of counting the number of perfect matchings in a planar graph is in NC. This result is based on the notion of a pfaffian orientation of a graph. (Recently, Galluccio and Loebl [7] gave a Ptime algorithm for the case of graphs of small genus.) H ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
It has been known for a long time now that the problem of counting the number of perfect matchings in a planar graph is in NC. This result is based on the notion of a pfaffian orientation of a graph. (Recently, Galluccio and Loebl [7] gave a Ptime algorithm for the case of graphs of small genus.) However, it is not known if the corresponding search problem, that of finding one perfect matching in a planar graph, is in NC. This situation is intriguing as it seems to contradict our intuition that search should be easier than counting. For the case of planar bipartite graphs, Miller and Naor [22] showed that a perfect matching can indeed be found using an NC algorithm. We present a very different NCalgorithm for this problem. Unlike the Miller...