Near-Optimal $\Left(1+\epsilon\right)-\Text{approximate}$ Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs
IEEE Annual Symposium on Foundations of Computer Science（2024）
Key words
Planar Graph,Distance Oracles,Dynamic Data Structure,Distance Emulator
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