Measuring Structural Similarities of Graphs in Linear Time

DOI10.1007/978-3-642-31770-5_34MaRDI QIDQ3167379zbMATH OpenOpenAlexFDO

Authors Zheng Fang, You Li, Jie Wang

Publication date 2 November 2012

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31770-5_34

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Efficient identifications of structural similarities for graphs
• A similarity measure for graphs with low computational complexity
• Graph similarity and approximate isomorphism
• scientific article; zbMATH DE number 2089760
• Graph similarity and distance in graphs
• Similarity measures over refinement graphs
• scientific article; zbMATH DE number 7053292
• On efficient network similarity measures

Cited in

(2)

• Efficient identifications of structural similarities for graphs
• scientific article; zbMATH DE number 7053292 (Why is no real title available?)

This page was built for publication: Measuring Structural Similarities of Graphs in Linear Time

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