-
...we present a parallel randomized algorithm for finding if two planar graphs are isomorphic. assuming that we have a tree of separators for each planar graph, our algorithm takes o(log(n)) t...
-
...subgraph homeomorphism with fixed pattern graph, recognition, and subgraph isomorphism for some classes of planar graphs. following the results of robertson...is the first example of a restriction of subgraph isomorphism to a non-trivial graph family admitting an nc algorithm....
-
... in this paper a systematic method for the design of efficient parallel algorithms for the dynamic evaluation of computation...functions. using this method, optimal parallel algorithms are given for many computation tree problems which are important
in parallel algebraic and numerical computation, and parallel code generation on exclusive read...
-
parallel algorithms for planar graph isomorphism and several related problems are presented. two models of parallel computation are considered: the crew...include o(√n)-time mesh algorithms for finding a good separating cycle and the triconnected components of a planar graph, and for solving the single-function coarsest...
-
a deterministic parallel algorithm for determining whether two planar graphs are isomorphic is presented. the algorithm needs o(log n) separators...is also shown that every planar graph has a separator, and a parallel algorithm for finding the separator is given...
-
...k5 and k3;3 contain a subdivision of k4, by kuratowski's theorem a series-parallel graph is planar. an outerplanar graph is a planar graph that can be embedded in...of the degree distribution of a random outerplanar graph (the denition for series-parallel graphs is exactly the same). for every n we consider the...
-
...on its complexity. there is a significant gap between extant lower and upper bounds for planar graphs as well. we bridge the gap for this natural and important special...log-space reduce the biconnected planar graph isomorphism and canonization problems to those for 3-connected planar graphs, which are known to be...
-
...we present a randomized parallel algorithm for finding a simple cycle separator in a planar graph. the size of the separator...o(n) time. combining our algorithm with the pan and reif [12] algorithm, enables us to find a bfs of planar graph in time o(log3(n...
-
...we present a parallel algorithm for colouring outer-planar graphs with minimal possible number of colours (at most 3). the algorithm runs in o(log n...the number of vertices of a given graph. as an application we obtain a six-colouring parallel algorithm for planar graphs running on the same model...
-
...discusses symmetric drawings of oneconnected planar graphs. more specifically, we discuss planar (geometric) automorphisms, that is, automorphisms of a graph g that can be represented...the previous results to cover planar graphs that are oneconnected. we present a linear time algorithm for drawing oneconnected planar graphs with a maximum number of symmetries....