Skip to main content
Conference Proceedings

Finding connected subgraphs of fixed minimum density: Implementation and experiments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9125 82-93
DOI: 10.1007/978-3-319-20086-6_7
4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider the following problem. Given a graph and a rational number μ, 0

Cite

CITATION STYLE

APA

Komusiewicz, C., Sorge, M., & Stahl, K. (2015). Finding connected subgraphs of fixed minimum density: Implementation and experiments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9125, pp. 82–93). Springer Verlag. https://doi.org/10.1007/978-3-319-20086-6_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free