Finding connected k-subgraphs with high density

Xujin Chen, Xiaodong Hu, Changjun Wang. Finding connected k-subgraphs with high density. Inf. Comput., 256:160-173, 2017. [doi]

@article{ChenHW17-4,
  title = {Finding connected k-subgraphs with high density},
  author = {Xujin Chen and Xiaodong Hu and Changjun Wang},
  year = {2017},
  doi = {10.1016/j.ic.2017.07.003},
  url = {https://doi.org/10.1016/j.ic.2017.07.003},
  researchr = {https://researchr.org/publication/ChenHW17-4},
  cites = {0},
  citedby = {0},
  journal = {Inf. Comput.},
  volume = {256},
  pages = {160-173},
}