MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "An Efficient Algorithm for Graph Isomorphism." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

4 documents found, showing 1 through 4.

ATOM

Isomorphism for Digraphs and Sequences of Shop Scheduling Problems
by Heidemarie Bräsel, Martin Harborth, Per Willenius
… Introduction Much effort has been made to find efficient algorithms for the graph isomorphism problem; i…
Cited by 2 (0 self) – Add To MetaCart

Is Code Equivalence Easy to Decide?
by Erez Petrank, Ron M. Roth — 1997 — IEEE Transactions on Information Theory
… efficient algorithm for determining whether two given graphs are isomorphic. In Section 4, we show a…
Cited by 7 (0 self) – Add To MetaCart

Code Equivalence
by Easy To, Erez Petrank, Ron M. Roth — 1997 — IEEE Transactions on Information Theory
… immediately yields an efficient algorithm for Graph Isomorphism. 2 Interactive proofs Loosely speaking…
Add To MetaCart

Tight Results on Multiregister Fourier Sampling: Quantum Measurements for Graph Isomorphism Require
by Cristopher Moore, Alexander Russell — 2008
… an efficient quantum algorithm for the Graph Automorphism and Graph Isomorphism problems (see e.g. Jozsa [19…
Cited by 1 (1 self) – Add To MetaCart

Showing 1 through 4.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB