Two local dissimilarity measures for weighted graphs with application to protein interaction networks

DOI10.1007/s11634-008-0018-3zbMath1146.05019OpenAlexW2054360688WikidataQ61198250 ScholiaQ61198250MaRDI QIDQ949442

Anaïs Baudot, Christine Brun, Alain Guénoche, Jean-Baptiste Angelelli

Publication date: 21 October 2008

Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11634-008-0018-3

zbMATH Keywords

graph partitioningbiological networksgraph distanceheuristic optimisation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Distance in graphs (05C12)

Related Items (1)

Bootstrap clustering for graph partitioning

Uses Software

• BIONJ
• MCODE

Cites Work

• Unnamed Item
• Maximum transfer distance between partitions
• The complexity of computing metric distances between partitions
• Comparison of algorithms in graph partitioning
• Comparing recent methods in graph partitioning
• Community structure in social and biological networks
• Computing Communities in Large Networks Using Random Walks

This page was built for publication: Two local dissimilarity measures for weighted graphs with application to protein interaction networks