✦ LIBER ✦

On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism

✍ Scribed by Moore, Cristopher; Russell, Alexander; Śniady, Piotr

Book ID: 118181045
Publisher: Society for Industrial and Applied Mathematics
Year: 2010
Tongue: English
Weight: 302 KB
Volume: 39
Category: Article
ISSN: 0097-5397
DOI: 10.1137/080724101

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A nonfactorial algorithm for testing iso

A nonfactorial algorithm for testing isomorphism of two graphs

✍ Mark.K. Goldberg 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 490 KB

On the Hardness of Graph Isomorphism

✍ Torán, Jacobo 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 545 KB

A V2 algorithm for determining isomorphi

A V2 algorithm for determining isomorphism of planar graphs

✍ John Hopcroft; Robert Tarjan 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 512 KB

A method for the recognition of graph is

A method for the recognition of graph isomorphism

✍ V. M. Kureichik; A. G. Korolev 📂 Article 📅 1977 🏛 Springer US 🌐 English ⚖ 613 KB

A linear-time algorithm for isomorphism

A linear-time algorithm for isomorphism of a subclass of chordal graphs

✍ N.Ch. Veeraraghavulu; P. Sreenivasa Kumar; C.E. Veni Madhavan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 404 KB

A V log V algorithm for isomorphism of t

A V log V algorithm for isomorphism of triconnected planar graphs

✍ J.E. Hopcroft; R.E. Tarjan 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 476 KB

An algorithm for determining whether two triconnected planar graphs are isomorphic is presented. The asymptotic growth rate of the algorithm is bounded by a constant times ! V ! log I V [ where I V I is the number of vertices in the graphs.