An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
From MaRDI portal
Publication:360469
Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)
Recommendations
- Algorithmic aspects of algebraic methods for graph isomorphism testing
- A computational approach to construct a multivariate complete graph invariant
- New invariants for the graph isomorphism problem
- Improving isomorphism rejection in sets of graphs
- Isomorphism testing via polynomial-time graph extensions
Cites work
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 823379 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 2229025 (Why is no real title available?)
- A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees
- A graph isomorphism algorithm for object recognition
- A history of graph entropy measures
- An Algorithm for Subgraph Isomorphism
- An Efficient Algorithm for Graph Isomorphism
- Complexity in chemistry, biology and ecology.
- Engineering an efficient canonical labeling tool for large and sparse graphs
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Graph isomorphism problem
- Information theory of complex networks: on evolution and architectural constraints
- Isomorph-Free Exhaustive Generation
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Numerical Analysis of a Unilateral Problem in Planar Thermoelasticity
- On Graph Complexity
- Series expansion of the directed percolation probability
- The graph isomorphism disease
Cited in
(11)- On the degeneracy of the Randić entropy and related graph measures
- Improving isomorphism rejection in sets of graphs
- Sharp lower bounds on the Narumi-Katayama index of graph operations
- Graph measures with high discrimination power revisited: a random polynomial approach
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach
- InfMatch: finding isomorphism subgraph on a big target graph based on the importance of vertex
- Highly unique network descriptors based on the roots of the permanental polynomial
- A large database of graphs and its use for benchmarking graph isomorphism algorithms
- On efficient network similarity measures
- A unified framework for strengthening topological node features and its application to subgraph isomorphism detection
- A novel approach for detection and elimination of automorphic graphs in graph databases
This page was built for publication: An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360469)
