Searching for "Corrigendum to "Completeness results for graph isomorphism" [J. Comput. System Sci. 66(2003) 549-566]." – sorted by Relevance.
-
Corrigendum:
- CORRIGENDUM: ON THE IRRATIONALITY OF SOME ALTERNATING SERIES J. SÁNDOR* AND J. SONDOW** The aim
- Add To MetaCart
-
Completeness results for Graph Isomorphism
- Completeness results for Graph Isomorphism Birgit Jenner Johannes Kobler Abt. Theoretische
- Cited by 10 (2 self) – Add To MetaCart
-
Completeness results for Graph Isomorphism
- Completeness results for Graph Isomorphism 1 Birgit Jenner a , Johannes Kobler b , Pierre Mc
- Add To MetaCart
-
isomorphism
- , isomorphism-complete, has been de ned. However, some topological restrictions on graphs (e.g., planar graphs
- Add To MetaCart
-
Corrigendum: The complexity of counting graph homomorphisms
- Corrigendum: The complexity of counting graph homomorphisms Martin Dyer School of Computing
- Cited by 1 (0 self) – Add To MetaCart
-
Decomposition of complete graphs into isomorphic cubes
- DECOMPOSITION OF COMPLETE GRAPHS INTO ISOMORPHIC FACTORS WITH A GIVEN DIAMETER ANTON KOTZIG
- Cited by 6 (0 self) – Add To MetaCart
-
Corrigendum to “Knotted Hamiltonian
- New York Journal of Mathematics New York J. Math. 14 (2008) 285–287. Corrigendum to “Knotted
- Add To MetaCart
-
The Graph Isomorphism Problem
- that the problem of counting the number of isomorphisms between two graphs is isomorphism-complete. This result
- Cited by 44 (0 self) – Add To MetaCart
-
isomorphic
- aftereffects arise from a cascade of two isomorphic adaptation mechanisms Alan A. Stocker Eero P. Simoncelli
- Add To MetaCart
-
On the Hardness of Graph Isomorphism
- with bounded color classes. For isomorphism in this class of graphs, the gap between our hardness results
- Cited by 20 (1 self) – Add To MetaCart

