Cite

Isolation concepts for efficiently enumerating dense subgraphs

MLA

Komusiewicz, Christian, et al. “Isolation Concepts for Efficiently Enumerating Dense Subgraphs.” Theoretical Computer Science, vol. 410, no. 38–40, Sept. 2009, pp. 3640–54. EBSCOhost, https://doi.org/10.1016/j.tcs.2009.04.021.



APA

Komusiewicz, C., Hüffner, F., Moser, H., & Niedermeier, R. (2009). Isolation concepts for efficiently enumerating dense subgraphs. Theoretical Computer Science, 410(38–40), 3640–3654. https://doi.org/10.1016/j.tcs.2009.04.021



Chicago

Komusiewicz, Christian, Falk Hüffner, Hannes Moser, and Rolf Niedermeier. 2009. “Isolation Concepts for Efficiently Enumerating Dense Subgraphs.” Theoretical Computer Science 410 (38–40): 3640–54. doi:10.1016/j.tcs.2009.04.021.