Jian Gao 0007, Zhenghang Xu, Ruizhi Li, Minghao Yin. An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs. In Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022. pages 10174-10183, AAAI Press, 2022. [doi]
@inproceedings{0007XLY22,
title = {An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs},
author = {Jian Gao 0007 and Zhenghang Xu and Ruizhi Li and Minghao Yin},
year = {2022},
url = {https://ojs.aaai.org/index.php/AAAI/article/view/21257},
researchr = {https://researchr.org/publication/0007XLY22},
cites = {0},
citedby = {0},
pages = {10174-10183},
booktitle = {Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022},
publisher = {AAAI Press},
isbn = {978-1-57735-876-3},
}