The graph isomorphism disease
From MaRDI portal
Publication:4159083
DOI10.1002/jgt.3190010410zbMath0381.05026MaRDI QIDQ4159083
Ronald C. Read, Derek Gordon Corneil
Publication date: 1977
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190010410
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
68W99: Algorithms in computer science
05-04: Software, source code, etc. for problems pertaining to combinatorics
Related Items
On complete systems of invariants for small graphs, Star partitions and the graph isomorphism problem, A new algorithm for solving the tree isomorphism problem, Focality and graph isomorphism, Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search, Graph isomorphism problem, Graph isomorphism and theorems of Birkhoff type, A general backtrack algorithm for the isomorphism problem of combinatorial objects, Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery, Branching in graphs and molecules, A fast backtrack algorithm for graph isomorphism, Cataloguing general graphs by point and line spectra, Graph theoretic models, Some elements of a Galois theory of the structure and complexity of the tree automorphism problem, Concerning the complexity of deciding isomorphism of block designs, Partitioning a graph in \(O(|A|\log_ 2|V|)\), Two reductions of graph isomorphism to problems on polynomials, A note on compact graphs, The invariant problem for binary string structures and the parallel complexity theory of queries, An optimal lower bound on the number of variables for graph identification, On the coding of ordered graphs, A graph isomorphism algorithm for object recognition, Simulated annealing and the mapping problem: A computational study, Graph algebras and the graph isomorphism problem, Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs, Efficient graph automorphism by vertex partitioning, Generation of molecular graphs based on flexible utilization of the available structural information, Graph isomorphism and identification matrices: Sequential algorithms, A study of eigenspaces of graphs, Some further development on the eigensystem approach for graph isomorphism detection, On the Characteristic Equations of the Characteristic Polynomial, Adjacency Matrices, The complexity of computing the automorphism group of automata and related problems, Isomorphism Testing in Hookup Classes
Cites Work
