An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
DOI10.1007/S10444-012-9281-0zbMATH Open1270.05071OpenAlexW2004014250MaRDI QIDQ360469FDOQ360469
Authors: Martin Grabner, Abbe Mowshowitz, Matthias Dehmer, Frank Emmert-Streib 
Publication date: 27 August 2013
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10444-012-9281-0
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
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)
Cites Work
- Title not available (Why is that?)
- An Algorithm for Subgraph Isomorphism
- Title not available (Why is that?)
- Title not available (Why is that?)
- Series expansion of the directed percolation probability
- Title not available (Why is that?)
- Title not available (Why is that?)
- A history of graph entropy measures
- The graph isomorphism disease
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Title not available (Why is that?)
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
- Isomorph-Free Exhaustive Generation
- On Graph Complexity
- Graph isomorphism problem
- A graph isomorphism algorithm for object recognition
- A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees
- Information theory of complex networks: on evolution and architectural constraints
- Numerical Analysis of a Unilateral Problem in Planar Thermoelasticity
- Complexity in chemistry, biology and ecology.
- An Efficient Algorithm for Graph Isomorphism
Cited In (11)
- On efficient network similarity measures
- Sharp lower bounds on the Narumi-Katayama index of graph operations
- Highly unique network descriptors based on the roots of the permanental polynomial
- A novel approach for detection and elimination of automorphic graphs in graph databases
- Improving isomorphism rejection in sets of graphs
- InfMatch: finding isomorphism subgraph on a big target graph based on the importance of vertex
- A unified framework for strengthening topological node features and its application to subgraph isomorphism detection
- On the degeneracy of the Randić entropy and related graph measures
- A large database of graphs and its use for benchmarking graph isomorphism algorithms
- Graph measures with high discrimination power revisited: a random polynomial approach
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach
Uses Software
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)
