Fifty years of graph matching, network alignment and network comparison
type: Item
instance of: scholarly article
title: Fifty years of graph matching, network alignment and network comparison
zbMATH Open document ID: 1398.68393
author: Frank Emmert-Streib
author: Matthias Dehmer
author: Yongtang Shi
published in: Information Sciences
publication date: 2018-10-30T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05-03
Mathematics Subject Classification ID: 68-03
Mathematics Subject Classification ID: 92-03
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 92C42
Mathematics Subject Classification ID: 92E10
zbMATH DE Number: 6968850
zbMATH Keywords: network comparison
zbMATH Keywords: network similarity
zbMATH Keywords: graph matching
zbMATH Keywords: quantitative graph theory
zbMATH Keywords: biological networks
zbMATH Keywords: computational graph theory
describes a project that uses: GSNCA
describes a project that uses: chemometrics
describes a project that uses: DNA
describes a project that uses: GHOST
describes a project that uses: SPINAL
describes a project that uses: NETAL
describes a project that uses: PINALOG
describes a project that uses: HubAlign
MaRDI profile type: Publication
full work available at URL: j.ins.2016.01.074
OpenAlex ID: W2289831356
cites work: Statistical mechanics of complex networks
cites work: A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
cites work: A graph distance metric based on the maximal common subgraph
cites work: Inexact graph matching for structural pattern recognition
cites work: Q4792074
cites work: Edge rotations and distance between graphs
cites work: Q3203049
cites work: Rotation and jump distances between graphs
cites work: Information processing in complex networks: Graph entropy and information functionals
cites work: Q5445046
cites work: A similarity measure for graphs with low computational complexity
cites work: Matching graphs with unique node labels
cites work: Q3286850
cites work: Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
cites work: A survey of graph edit distance
cites work: Q4198056
cites work: Learning Theory and Kernel Machines
cites work: Q4198074
cites work: Q3896506
cites work: Algorithms on Strings, Trees and Sequences
cites work: Q5572939
cites work: Q3960888
cites work: Q3744203
cites work: Q3734424
cites work: Q3199435
cites work: Authoritative sources in a hyperlinked environment
cites work: Q5528329
cites work: Distance-based analysis of variance: Approximate inference
cites work: Q3666286
cites work: Q5386180
cites work: Q5678435
cites work: The tree-to-tree editing problem
cites work: Q3960889
cites work: Q3778584
cites work: Tools and Algorithms for the Construction and Analysis of Systems
cites work: Q5535994
cites work: The Tree-to-Tree Correction Problem
cites work: Multivariate image similarity in the compressed domain using statistical graph matching
cites work: An Algorithm for Subgraph Isomorphism
cites work: Q5564127
cites work: Collective dynamics of ‘small-world’ networks

Fifty years of graph matching, network alignment and network comparison (cites work)
cites work: Graph similarity scoring and matching

Fifty years of graph matching, network alignment and network comparison (cites work)
cites work: On a certain distance between isomorphism classes of graphs

Fifty years of graph matching, network alignment and network comparison (DOI)
DOI: 10.1016/J.INS.2016.01.074