A Randomized Parallel Algorithm for Planar Graph Isomorphism

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.28, Iss.2, 1998-08, pp. : 290-314

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Randomized Parallel Algorithm for Single-Source Shortest Paths

By Klein P.N. Subramanian S.

Journal of Algorithms, Vol. 25, Iss. 2, 1997-11 ,pp. : 205-220

Academic Press

Access to resources Recommend Favorite

A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph

By Luczak T. Szymanska E.

Journal of Algorithms, Vol. 25, Iss. 2, 1997-11 ,pp. : 311-320

Academic Press

Access to resources Recommend Favorite

Functional approach to the Hamiltonian circuit and graph isomorphism problems

By Faizullin R.

Journal of Mathematical Sciences, Vol. 168, Iss. 3, 2010-07 ,pp. : 475-477

Springer Publishing Company

Access to resources Recommend Favorite

Isomorphism Testing via Polynomial-Time Graph Extensions

By Porumbel Daniel

Journal of Mathematical Modelling and Algorithms, Vol. 10, Iss. 2, 2011-06 ,pp. : 119-143

Springer Publishing Company

Access to resources Recommend Favorite

Parallel Composition of Graph Grammars

By Ribeiro L.

Applied Categorical Structures, Vol. 7, Iss. 4, 1999-12 ,pp. : 405-430

Springer Publishing Company

Access to resources Recommend Favorite