Graph isomorphism problem
From MaRDI portal
Translation from Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 118, 83-158 (Russian) (1982; Zbl 0531.05047).
Cites work
- 2-Isomorphic Graphs
- A correction to Colbourn's paper on the complexity of matrix symmetrizability
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- A new algorithm for digraph isomorphism
- A note on the graph isomorphism counting problem
- A Set of Topological Invariants for Graphs
- A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
- An Algorithm for Finding the Blocks of a Permutation Group
- An Efficient Algorithm for Graph Isomorphism
- Asymmetric graphs
- Coherent configurations. I: Ordinary representation theory
- Complexity of wild matrix problems and of isomorphism of algebras and graphs
- Describing an algorithm by Hopcroft
- Dividing a Graph into Triconnected Components
- Efficient Planarity Testing
- Further annotated bibliography on the isomorphism disease
- Generalized Matrix Functions and the Graph Isomorphism Problem
- GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
- Graph 2-isomorphism is NP-complete
- Graph isomorphism, general remarks
- Graph isomorphism: A heuristic edge-partitioning-oriented algorithm
- Graphs and k-Societies
- Groups with a small number of automorphisms
- Hadamard equivalence via graph isomorphism
- scientific article; zbMATH DE number 3650612 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3664988 (Why is no real title available?)
- scientific article; zbMATH DE number 3671712 (Why is no real title available?)
- scientific article; zbMATH DE number 3674138 (Why is no real title available?)
- scientific article; zbMATH DE number 3679848 (Why is no real title available?)
- scientific article; zbMATH DE number 3723875 (Why is no real title available?)
- scientific article; zbMATH DE number 3722702 (Why is no real title available?)
- scientific article; zbMATH DE number 3762116 (Why is no real title available?)
- scientific article; zbMATH DE number 3779388 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3544088 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3575612 (Why is no real title available?)
- scientific article; zbMATH DE number 3614188 (Why is no real title available?)
- scientific article; zbMATH DE number 3633736 (Why is no real title available?)
- scientific article; zbMATH DE number 3430698 (Why is no real title available?)
- scientific article; zbMATH DE number 3218790 (Why is no real title available?)
- scientific article; zbMATH DE number 3368661 (Why is no real title available?)
- scientific article; zbMATH DE number 3031989 (Why is no real title available?)
- Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Isomorphism Testing and Symmetry of Graphs
- Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems
- Lattices With a Given Abstract Group of Automorphisms
- Le problème d'étoiles pour graphes est NP-complèt
- Note on Isomorphisms of Graphs
- On a certain distance between isomorphism classes of graphs
- On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
- On counting problems and the polynomial-time hierarchy
- On deciding switching equivalence of graphs
- On full embeddings of categories of algebras
- On testing isomorphism of permutation graphs
- On the \(n\log{n}\) isomorphism technique (preliminary report)
- On the Classification of Graphs
- On the Complexity of Canonical Labeling of Strongly Regular Graphs
- On the ratio of optimal integral and fractional covers
- Random Graph Isomorphism
- Some NP-Complete Problems Similar to Graph Isomorphism
- The Complexity of Combinatorial Isomorphism Problems
- The complexity of computing the permanent
- The complexity of symmetrizing matrices
- The graph isomorphism disease
- Two reductions of graph isomorphism to problems on polynomials
Cited in
(42)- A term equality problem equivalent to graph isomorphism
- Isomorphic unordered labeled trees up to substitution ciphering
- Isomorphism testing for \(T\)-graphs in FPT
- Polynomial equivalence of the problems ``predicate formulas isomorphism and graph isomorphism
- Binets: fundamental building blocks for phylogenetic networks
- Maximum common induced subgraph parameterized by vertex cover
- Almost equitable partitions and controllability of leader-follower multi-agent systems
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs
- Permutation Groups and the Graph Isomorphism Problem
- Isomorphism of (mis)Labeled Graphs
- Some recognition problems related to graph isomorphism
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
- The Structure of Level-k Phylogenetic Networks
- scientific article; zbMATH DE number 2010173 (Why is no real title available?)
- scientific article; zbMATH DE number 7559375 (Why is no real title available?)
- GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM
- Lorentzian spectral geometry with causal sets
- Graph theory (algorithmic, algebraic, and metric problems)
- Computational complexity of computing symmetries in finite-domain planning
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- On the complexity of identifying strongly regular graphs
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs
- Faster isomorphism for p-groups of class 2 and exponent p
- Count-free Weisfeiler-Leman and group isomorphism
- Recognition and isomorphism of proper \(H \)-graphs for unicyclic \(H\) in \textit{FPT}-time
- Homomorphically full oriented graphs
- Isomorphism testing via polynomial-time graph extensions
- Graph isomorphism in quasipolynomial time parameterized by treewidth
- Complexity of identifying fitting-free groups
- On the descriptive complexity of groups without abelian normal subgroups
- Testing isomorphism between tuples of subspaces
- On the parallel complexity of group isomorphism via Weisfeiler-Leman
- On the complexity of isomorphism problems for tensors, groups, and polynomials III: actions by classical groups
- Continuous optimization methods for the graph isomorphism problem
- On the descriptive complexity of groups without abelian normal subgroups (extended abstract)
- On p-group isomorphism: search-to-decision, counting-to-decision and nilpotency class reductions via tensors
- On the complexity of isomorphism problems for tensors, groups, and polynomials. I: Tensor isomorphism-completeness
- Parallel complexity of identifying groups and quasigroups via decompositions
- Determining isomorphic crystal structures
- Graph isomorphism: mixed-integer convex optimization from first-order methods
- On the isomorphism of graphs having some eigenvalues of moderate multiplicity
- A computational approach to construct a multivariate complete graph invariant
This page was built for publication: Graph isomorphism problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1057883)
