Fifty years of graph matching, network alignment and network comparison
DOI10.1016/J.INS.2016.01.074zbMATH Open1398.68393OpenAlexW2289831356MaRDI QIDQ1991876FDOQ1991876
Authors: Frank Emmert-Streib, Matthias Dehmer, Yongtang Shi 
Publication date: 30 October 2018
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2016.01.074
Recommendations
graph matchingbiological networksquantitative graph theorynetwork similaritynetwork comparisoncomputational graph theory
Applications of graph theory (05C90) Pattern recognition, speech recognition (68T10) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Systems biology, networks (92C42) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Small world graphs, complex networks (graph-theoretic aspects) (05C82) History of computer science (68-03) History of biology (92-03) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) History of combinatorics (05-03)
Cites Work
- Statistical mechanics of complex networks
- Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
- Title not available (Why is that?)
- An Algorithm for Subgraph Isomorphism
- Title not available (Why is that?)
- Algorithms on Strings, Trees and Sequences
- Collective dynamics of `small-world' networks
- Authoritative sources in a hyperlinked environment
- The structure and dynamics of networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of graph edit distance
- The Tree-to-Tree Correction Problem
- Title not available (Why is that?)
- Information processing in complex networks: Graph entropy and information functionals
- Edge rotations and distance between graphs
- On a certain distance between isomorphism classes of graphs
- On graph kernels: hardness results and efficient alternatives.
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
- Inexact graph matching for structural pattern recognition
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Graph similarity scoring and matching
- A graph distance metric based on the maximal common subgraph
- A similarity measure for graphs with low computational complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- The tree-to-tree editing problem
- Title not available (Why is that?)
- A new method of measuring similarity for a special class of directed graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multivariate image similarity in the compressed domain using statistical graph matching
- Title not available (Why is that?)
- Matching graphs with unique node labels
- Title not available (Why is that?)
- Rotation and jump distances between graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distance-based analysis of variance: Approximate inference
Cited In (33)
- A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration
- Relationships between symmetry-based graph measures
- Quantitative graph theory: a new branch of graph theory and network science
- On efficient network similarity measures
- Stackelberg game based relay selection for physical layer security and energy efficiency enhancement in cognitive radio networks
- Comparing large-scale graphs based on quantum probability theory
- Network similarity measure and Ediz eccentric connectivity index
- Strong behavioral similarities in timed-arc Petri nets
- Counterexamples to conjectures on graph distance measures based on topological indexes
- Network distances for weighted digraphs
- Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances
- A new coupled disease-awareness spreading model with mass media on multiplex networks
- Impact of self interaction on the evolution of cooperation in social spatial dilemmas
- New inequalities for network distance measures by using graph spectra
- Highly unique network descriptors based on the roots of the permanental polynomial
- Spectrally robust graph isomorphism
- On network similarities and their applications
- Magnitude and Topological Entropy of Digraphs
- Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis
- New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks
- Inferring the reputation enhances the cooperation in the public goods game on interdependent lattices
- Heat diffusion distance processes: a statistically founded method to analyze graph data sets
- Properties of graph distance measures by means of discrete inequalities
- Subgraph matching on temporal graphs
- Network comparison and the within-ensemble graph distance
- Quantum walk inspired algorithm for graph similarity and isomorphism
- Network Analysis
- A comparative analysis of new graph distance measures and graph edit distance
- Network entropies based on independent sets and matchings
- Compositional properties of alignments
- Network alignment by discrete Ollivier-Ricci flow
- Graph distance measures based on topological indices revisited
- The effect of graph operations on the degree-based entropy
Uses Software
This page was built for publication: Fifty years of graph matching, network alignment and network comparison
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1991876)
