Faster diameter computation in graphs of bounded Euler genus
From MaRDI portal
Cites work
- A combinatorial problem; stability and order for models and theories in infinitary languages
- Algorithms for graphs of bounded treewidth via orthogonal range searching
- Algorithms for the edge-width of an embedded graph
- Better diameter algorithms for bounded VC-dimension graphs and geometric intersection graphs
- Diameter, eccentricities and distance oracle computations on H-minor free graphs and graphs of bounded (distance) Vapnik-Chervonenkis dimension
- Fast approximation algorithms for the diameter and radius of sparse graphs
- Graph minors. XVI: Excluding a non-planar graph
- Graphs on surfaces
- Greedy optimal homotopy and homology generators
- Killing a vortex
- Minor containment and disjoint paths in almost-linear time
- New Data Structures for Orthogonal Range Queries
- On the density of families of sets
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Planar diameter via metric compression
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
- Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs
- VC set systems in minor-free (di)graphs and applications
- Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
This page was built for publication: Faster diameter computation in graphs of bounded Euler genus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363197)
