The graph isomorphism disease
From MaRDI portal
Publication:4159083
DOI10.1002/jgt.3190010410zbMath0381.05026OpenAlexW2073067110MaRDI 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
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Graph algebras and the graph isomorphism problem, On the Combinatorial Power of the Weisfeiler-Lehman Algorithm, Isomorphism Testing in Hookup Classes, Detecting almost symmetries of graphs, A study of eigenspaces of graphs, Generic case complexity of the graph isomorphism problem, A general backtrack algorithm for the isomorphism problem of combinatorial objects, Adjacency Matrices, Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery, Branching in graphs and molecules, A fast backtrack algorithm for graph isomorphism, An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants, Probing the space of toric quiver theories, Generation of molecular graphs based on flexible utilization of the available structural information, Cataloguing general graphs by point and line spectra, Super/rosy \(L^k\)-theories and classes of finite structures, Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves, A Fourier-theoretic approach for inferring symmetries, On the Characteristic Equations of the Characteristic Polynomial, Computing Autotopism Groups of Partial Latin Rectangles, Graph-Based Generation of Referring Expressions, Computational complexity of reconstruction and isomorphism testing for designs and line graphs, Spectral classes of regular, random, and empirical graphs, Star partitions and the graph isomorphism problem, Graph theoretic models, Using somatic mutation data to test tumors for clonal relatedness, A computational approach to construct a multivariate complete graph invariant, Theory of graph neural networks: representation and learning, Some elements of a Galois theory of the structure and complexity of the tree automorphism problem, Practical graph isomorphism. II., Concerning the complexity of deciding isomorphism of block designs, Focality and graph isomorphism, Partitioning a graph in \(O(|A|\log_ 2|V|)\), Canonical labels for protein spots of proteomics maps, On complete systems of invariants for small graphs, Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search, Two reductions of graph isomorphism to problems on polynomials, A note on compact graphs, Graph isomorphism and identification matrices: Sequential algorithms, The complexity of computing the automorphism group of automata and related problems, A computational comparison of symmetry handling methods for mixed integer programs, The invariant problem for binary string structures and the parallel complexity theory of queries, On the power of combinatorial and spectral invariants, An optimal lower bound on the number of variables for graph identification, Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs, Computing graph automorphism from partial solutions, On families of categorial grammars of bounded value, their learnability and related complexity questions, Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks, On the coding of ordered graphs, Computational complexity of computing a partial solution for the graph automorphism problems, A graph isomorphism algorithm for object recognition, Graph based isomorph-free generation of two-level regular fractional factorial designs, Efficient graph automorphism by vertex partitioning, A new algorithm for solving the tree isomorphism problem, Some further development on the eigensystem approach for graph isomorphism detection, Sherali-Adams relaxations of graph isomorphism polytopes, Graph isomorphism problem, Graph isomorphism and theorems of Birkhoff type, Simulated annealing and the mapping problem: A computational study
Cites Work
