The complexity of testing all properties of planar graphs, and the role of isomorphism

Sabyasachi Basu, Akash Kumar 0003, C. Seshadhri. The complexity of testing all properties of planar graphs, and the role of isomorphism. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 1702-1714, SIAM, 2022. [doi]

Authors

Sabyasachi Basu

This author has not been identified. Look up 'Sabyasachi Basu' in Google

Akash Kumar 0003

This author has not been identified. Look up 'Akash Kumar 0003' in Google

C. Seshadhri

This author has not been identified. Look up 'C. Seshadhri' in Google