Iterative node matching between complex networks

DOI10.1088/1751-8113/43/39/395002MaRDI QIDQ3052861zbMATH OpenOpenAlexFDO

Authors Qi Xuan, Fang Du, Tiejun Wu

Publication date 3 November 2010

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/7c622ec92dac5e05807294d6c2f52c465909ed11

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Software, source code, etc. for problems pertaining to information and communication theory (94-04) Applications of graph theory to circuits and networks (94C15)

Recommendations

• ONE-TO-MANY NODE MATCHING BETWEEN COMPLEX NETWORKS
• Node matching computation between two large graphs in linear computational cost
• Maximum common subgraph based social network alignment method
• Multi-objective optimization model and evolutional solution of network node matching problem
• Matchability of heterogeneous networks pairs

Cited in

(4)

• Match algorithms for generalized Rete networks
• A schema-independent user identification algorithm in social networks
• ONE-TO-MANY NODE MATCHING BETWEEN COMPLEX NETWORKS
• scientific article; zbMATH DE number 6304438 (Why is no real title available?)

This page was built for publication: Iterative node matching between complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3052861)