Searching for "On the graph isomorphism problem" – sorted by Relevance.
-
The Graph Isomorphism Problem
- University of Alberta The Graph Isomorphism Problem by Scott Fortin Technical Report TR 96--20 July
- Cited by 44 (0 self) – Add To MetaCart
-
A global constraint for graph isomorphism problems
- A Global Constraint for Graph Isomorphism Problems Sébastien Sorlin and Christine Solnon LIRIS
- Cited by 11 (2 self) – Add To MetaCart
-
A Quantum Observable for the Graph Isomorphism Problem
- A Quantum Observable for the Graph Isomorphism Problem Mark Ettinger Los Alamos National
- Cited by 11 (0 self) – Add To MetaCart
-
The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3
- -89069 Ulm, Germany, toran@(email omitted); Abstract. We prove that the graph isomorphism problem
- Cited by 3 (1 self) – Add To MetaCart
-
ScrewBox: a Randomized Certifying
- , 2006 Abstract We present a novel randomized approach to the graph isomorphism problem. Our algorithm
- Add To MetaCart
-
THE ISOMORPHISM PROBLEM FOR PLANAR 3-CONNECTED GRAPHS IS IN UNAMBIGUOUS LOGSPACE
- (Bordeaux), pp. 633-644 www.stacs-conf.org THE ISOMORPHISM PROBLEM FOR PLANAR 3-CONNECTED GRAPHS
- Cited by 1 (0 self) – Add To MetaCart
-
ON THE HARDNESS OF GRAPH ISOMORPHISM ∗
- ON THE HARDNESS OF GRAPH ISOMORPHISM ∗ JACOBO TOR ÁN† Abstract. We show that the graph isomorphism problem is hard
- Add To MetaCart
-
Isomorphism for Digraphs and Sequences of Shop Scheduling Problems
- complexity of the graph isomorphism problem is still unknown. We consider Cartesian products K n \Theta Km
- Cited by 2 (0 self) – Add To MetaCart
-
On the Hardness of Graph Isomorphism
- for the graph isomorphism problem, and imply a randomized logarithmic space reduction from the perfect matching
- Cited by 20 (1 self) – Add To MetaCart
-
A Global Constraint for Graph Isomorphism
- A global constraint for graph isomorphism problems Sbastien Sorlin, Christine Solnon LIRIS, CNRS
- Add To MetaCart

