Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset

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]

Authors

Wenbin Chen

This author has not been identified. Look up 'Wenbin Chen' in Google

Lingxi Peng

This author has not been identified. Look up 'Lingxi Peng' in Google

Jianxiong Wang

This author has not been identified. Look up 'Jianxiong Wang' in Google

FuFang Li

This author has not been identified. Look up 'FuFang Li' in Google

Maobin Tang

This author has not been identified. Look up 'Maobin Tang' in Google