Results 1  10
of
94
Planar and grid graph reachability problems
 THEOR. COMP. SYS
, 2009
"... We study the complexity of restricted versions of stconnectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, of which grid graphs are an important special case. Our main results are: • Reachability in graphs of genus one is logspac ..."
Abstract

Cited by 17 (4 self)
 Add to MetaCart
We study the complexity of restricted versions of stconnectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, of which grid graphs are an important special case. Our main results are: • Reachability in graphs of genus one
The Complexity of Planar Graph Isomorphism
"... The Graph Isomorphism problem restricted to planar graphs has been known to be solvable in polynomial time many years ago. In terms of complexity classes however, the exact complexity of the problem has been established only very recently. It was proved in [6] that planar graph isomorphism can be co ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The Graph Isomorphism problem restricted to planar graphs has been known to be solvable in polynomial time many years ago. In terms of complexity classes however, the exact complexity of the problem has been established only very recently. It was proved in [6] that planar graph isomorphism can
COMPLEXITY THEORETIC ASPECTS OF PLANAR RESTRICTIONS AND OBLIVIOUSNESS
, 2006
"... In this thesis, we deal largely with complexity theoretic aspects in planar restrictions and obliviousness. Our main motivation was to identify problems for which the planar restriction is much easier, computationally, than the unrestricted version. First, we study constant width polynomialsized ci ..."
Abstract
 Add to MetaCart
look at different notions of connectivity. We investigate the directed planar graph reachability problem, as a possibly more tractable special case of the arbitrary graph reachability problem (which is NLcomplete). We prove that this problem logspacereduces to its complement, and also
Limits to Parallel Computation: PCompleteness Theory
, 1995
"... D. Kavadias, L. M. Kirousis, and P. G. Spirakis. The complexity of the reliable connectivity problem. Information Processing Letters, 39(5):245252, 13 September 1991. (135) [206] P. Kelsen. On computing a maximal independent set in a hypergraph of constant dimension in parallel. In Proceedings of ..."
Abstract

Cited by 167 (5 self)
 Add to MetaCart
D. Kavadias, L. M. Kirousis, and P. G. Spirakis. The complexity of the reliable connectivity problem. Information Processing Letters, 39(5):245252, 13 September 1991. (135) [206] P. Kelsen. On computing a maximal independent set in a hypergraph of constant dimension in parallel. In Proceedings
Map Graphs
, 1999
"... We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planarity requires). Such adjacencies define a map graph. We give an NP characterization for such graphs, and an O(n³)time ..."
Abstract

Cited by 37 (3 self)
 Add to MetaCart
We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planarity requires). Such adjacencies define a map graph. We give an NP characterization for such graphs, and an O
On graph isomorphism for restricted graph classes
 In
, 2006
"... Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn’t be solved by classifying it as being either NPcomplete or solvable in P. Nevertheless, efficient (polynomialtime or even NC) algorithms for restricted versions of GI have been found over th ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn’t be solved by classifying it as being either NPcomplete or solvable in P. Nevertheless, efficient (polynomialtime or even NC) algorithms for restricted versions of GI have been found over
Graph Drawing '93
, 1993
"... not Available. Characterizing Proximity Trees Prosenjit Bose, William Lenhart, y and Giuseppe Liotta z Much attention has been given over the past several years to developing algorithms for embedding abstract graphs in the plane such that the resulting drawing has certain geometric properties ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
properties. For example, those graphs which admit planar drawings have been completely characterized and efficient algorithms for producing planar drawings of these graphs have been designed ([4], [9]). For an overview of graph drawing problems and algorithms, the reader is referred to the excellent
Fast algorithms for decomposable graphs
, 2013
"... A celebrated theorem by Courcelle states that every problem definable in monadic secondorder logic (MSO) can be solved in linear time on graphs of bounded treewidth. This metatheorem along with its extensions by Arnborg, Lagergren, and Seese as well as by Courcelle and Mosbah explains, why many ..."
Abstract
 Add to MetaCart
A celebrated theorem by Courcelle states that every problem definable in monadic secondorder logic (MSO) can be solved in linear time on graphs of bounded treewidth. This metatheorem along with its extensions by Arnborg, Lagergren, and Seese as well as by Courcelle and Mosbah explains, why many
Results 1  10
of
94