ONE-TO-MANY NODE MATCHING BETWEEN COMPLEX NETWORKS

DOI10.1142/S0219525910002827MaRDI QIDQ3067100zbMATH OpenOpenAlexFDO

Authors Fang Du, Qi Xuan, Tiejun Wu

Publication date 20 January 2011

Published in Advances in Complex Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0219525910002827

zbMATH Keywords

complex networksensemblinginter-network searchingnode matching

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Matching models (91B68)

Recommendations

• Iterative node matching between complex networks
• Matchability of heterogeneous networks pairs
• Match making in complex social networks
• Reconstruction of networks from one-step data by matching positions
• Node matching computation between two large graphs in linear computational cost
• On efficient network similarity measures
• One-to-many node-disjoint paths of hyper-star networks
• Generalized matching networks and their properties

Cites work

• A decision-theoretic generalization of on-line learning and an application to boosting
• A local-world evolving network model
• Collective dynamics of `small-world' networks
• Iterative node matching between complex networks
• Random forests

Cited in

(3)

• Locating names on vertices of a transaction network
• Multi-objective optimization model and evolutional solution of network node matching problem
• Iterative node matching between complex networks

This page was built for publication: ONE-TO-MANY NODE MATCHING BETWEEN COMPLEX NETWORKS

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