Graph clustering using the weighted minimum common supergraph

DOI10.1007/3-540-45028-9_21MaRDI QIDQ4450810zbMATH OpenFDO

Authors Pasquale Foggia, C. Guidobaldi, Mario Vento, Horst Bunke

Publication date 16 February 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2726/27260235.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Recommendations

• A graph clustering algorithm based on a clustering coefficient for weighted graphs
• Exact clustering of weighted graphs via semidefinite programming
• Graph Clustering and Minimum Cut Trees
• Graph clustering
• Weighted clustering of attributed multi-graphs
• Graph clustering via intra-cluster density maximization
• Graph clustering with a constraint on cluster sizes

Cited in

(9)

• Median graphs: A genetic approach based on new theoretical properties
• Protein classification by matching and clustering surface graphs
• Statistical graph space analysis
• A graph clustering algorithm based on a clustering coefficient for weighted graphs
• A spectral approach to learning structural variations in graphs
• Graph clustering
• Weighted graph-matching using modal clusters
• Common object discovery as local search for maximum weight cliques in a global object similarity graph
• Graph embedding using tree edit-union

This page was built for publication: Graph clustering using the weighted minimum common supergraph

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