In Search of the Densest Subgraph
AbstractIn this survey paper, we review various concepts of graph density, as well as associated theorems and algorithms. Our goal is motivated by the fact that, in many applications, it is a key algorithmic task to extract a densest subgraph from an input graph, according to some appropriate definition of graph density. While this problem has been the subject of active research for over half of a century, with many proposed variants and solutions, new results still continuously emerge in the literature. This shows both the importance and the richness of the subject. We also identify some interesting open problems in the field. View Full-Text
Share & Cite This Article
Faragó, A.; R. Mojaveri, Z. In Search of the Densest Subgraph. Algorithms 2019, 12, 157.
Faragó A, R. Mojaveri Z. In Search of the Densest Subgraph. Algorithms. 2019; 12(8):157.Chicago/Turabian Style
Faragó, András; R. Mojaveri, Zohre. 2019. "In Search of the Densest Subgraph." Algorithms 12, no. 8: 157.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.