New polynomial delay bounds for maximal subgraph enumeration by proximity search - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Alessio Conte' in GoogleThis author has not been identified. Look up 'Takeaki Uno' in Google

runs on WebDSL