New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing（2020）
Key words
Algorithm,Planar graphs,Sparsest cut
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined