Chapter 12. Network comparison

DOI10.1007/978-3-540-31955-9_12MaRDI QIDQ5703973zbMATH OpenOpenAlexFDO

Authors Michael Baur, Marc Benkert

Publication date 11 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106453

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• McKay's canonical graph labeling algorithm
• Practical graph isomorphism. II.
• Fifty years of graph matching, network alignment and network comparison
• Subgraphs as a measure of similarity
• Isomorphism of (mis)Labeled Graphs

Cited in

(6)

• Regularized determinants for quantum field theories with fermions
• The resistance perturbation distance: a metric for the analysis of dynamic networks
• Fifty years of graph matching, network alignment and network comparison
• Graph based analysis for gene segment organization in a scrambled genome
• Comments to ``Quantification of network structural dissimilarities published by Schieber et al
• Some simple algorithms for structural comparison

Describes a project that uses

Uses Software

• nauty

This page was built for publication: Chapter 12. Network comparison

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