Querying Minimal Steiner Maximum-Connected Subgraphs in Large Graphs.

@inproceedings{hu-2016-querying, author = {Jiafeng Hu and Xiaowei Wu and Reynold Cheng and Siqiang Luo and Yixiang Fang}, editor = {Snehasis Mukhopadhyay and ChengXiang Zhai and Javed Mostafa and Elisa Bertino and Fabio Crestani and Javed Mostafa and Jie Tang and Luo Si and Xiaofang Zhou and Yi Chang and Yunyao Li and Parikshit Sondhi}, title = {{Querying Minimal Steiner Maximum-Connected Subgraphs in Large Graphs}}, booktitle = {{Proceedings of the 25th ACM International Conference on Information and Knowledge Management, CIKM 2016, Indianapolis, IN, USA, October 24-28, 2016}}, pages = {1241--1250}, publisher = {ACM}, year = {2016}, url = {https://doi.org/10.1145/2983323.2983748}, doi = {https://doi.org/10.1145/2983323.2983748} }