Looking for High Density Zones in a Graph

DOI10.1007/978-3-540-73560-1_18MaRDI QIDQ5302507zbMATH OpenOpenAlexFDO

Authors Tristan Colombo, Alain Guénoche

Publication date 7 January 2009

Published in Selected Contributions in Data Analysis and Classification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73560-1_18

zbMATH Keywords

vertices in a graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Dense and sparse graph partition
• Determination of the densest subgraph
• In search of the densest subgraph
• Generalized density clustering
• Comparison of algorithms in graph partitioning

This page was built for publication: Looking for High Density Zones in a Graph

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