ONE-TO-MANY NODE MATCHING BETWEEN COMPLEX NETWORKS

DOI10.1142/S0219525910002827zbMath1203.90030OpenAlexW2148444204MaRDI QIDQ3067100

Tie-Jun Wu, Fang Du, Qi Xuan

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 networksnode matchingensemblinginter-network searching

Mathematics Subject Classification ID

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

Cites Work

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

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