Wenbin Chen, Lingxi Peng, Jianxiong Wang, FuFang Li, Maobin Tang. Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset. In Zaixin Lu, Donghyun Kim, Weili Wu, Wei Li, Ding-Zhu Du, editors, Combinatorial Optimization and Applications - 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings. Volume 9486 of Lecture Notes in Computer Science, pages 566-573, Springer, 2015. [doi]
@inproceedings{ChenPWLT15,
title = {Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset},
author = {Wenbin Chen and Lingxi Peng and Jianxiong Wang and FuFang Li and Maobin Tang},
year = {2015},
doi = {10.1007/978-3-319-26626-8_41},
url = {http://dx.doi.org/10.1007/978-3-319-26626-8_41},
researchr = {https://researchr.org/publication/ChenPWLT15},
cites = {0},
citedby = {0},
pages = {566-573},
booktitle = {Combinatorial Optimization and Applications - 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings},
editor = {Zaixin Lu and Donghyun Kim and Weili Wu and Wei Li and Ding-Zhu Du},
volume = {9486},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-26625-1},
}