(2019, June 23). New polynomial delay bounds for maximal subgraph enumeration by proximity search. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. https://doi.org/10.1145/3313276.3316402
Chicago Style (17th ed.) Citation"New Polynomial Delay Bounds for Maximal Subgraph Enumeration by Proximity Search." Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing 23 Jun. 2019. https://doi.org/10.1145/3313276.3316402.
MLA (9th ed.) Citation"New Polynomial Delay Bounds for Maximal Subgraph Enumeration by Proximity Search." Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 23 Jun. 2019, https://doi.org/10.1145/3313276.3316402.
Warning: These citations may not always be 100% accurate.