1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2023★ 1 cited
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More
Hsien-Chih Chang, Jonathan Conroy, Hung Le +3
The notion of shortcut partition, introduced recently by Chang, Conroy, Le, Milenković, Solomon, and Than [CCLMST23], is a new type of graph partition into low-diameter clusters. R…
cs.DS2022
Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency
Hung Le
Thorup [FOCS'01, JACM'04] and Klein [SODA'01] independently showed that there exists a -approximate distance oracle for planar graphs with space and $O…