A new construction gives a (1+ε) distance‑approximating minor for planar and minor‑free graphs, sized Õε(k) and built with a near‑linear algorithm for fast processing. https://getnews.me/distance-approximating-minors-for-planar-minor-free-graphs/ #distanceapproximation #graphalgorithms #planargraphs
September 24, 2025 at 7:24 PM
A new construction gives a (1+ε) distance‑approximating minor for planar and minor‑free graphs, sized Õε(k) and built with a near‑linear algorithm for fast processing. https://getnews.me/distance-approximating-minors-for-planar-minor-free-graphs/ #distanceapproximation #graphalgorithms #planargraphs