New polynomial delay bounds for maximal subgraph enumeration by proximity search

Alessio Conte, Takeaki Uno. New polynomial delay bounds for maximal subgraph enumeration by proximity search. In Moses Charikar, Edith Cohen, editors, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019. pages 1179-1190, ACM, 2019. [doi]

Abstract

Abstract is missing.