Algorithms for distance problems in continuous graphs
From MaRDI portal
Cites work
- A c^k n 5-approximation algorithm for treewidth
- A partial k-arboretum of graphs with bounded treewidth
- Algorithms for graphs of bounded treewidth via orthogonal range searching
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- Augmenting graphs to minimize the radius
- Combinatorial solutions of multidimensional divide-and-conquer recurrences
- Computing optimal shortcuts for networks
- Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth
- Continuous mean distance of a weighted graph
- Diameter, eccentricities and distance oracle computations on H-minor free graphs and graphs of bounded (distance) Vapnik-Chervonenkis dimension
- Eccentricity queries and beyond using hub labels
- Fast approximation algorithms for the diameter and radius of sparse graphs
- Genericity of simple eigenvalues for a metric graph
- scientific article; zbMATH DE number 3682249 (Why is no real title available?)
- scientific article; zbMATH DE number 6792403 (Why is no real title available?)
- Title not available (Why is no real title available?)
- Improving the Dilation of a Metric Graph by Adding Edges
- Mean distance on metric graphs
- Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
- Multivariate analysis of orthogonal range searching and graph distances
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Shortcut sets for the locus of plane Euclidean networks
- Shortcuts for the circle
- Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs
- Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
- The generalized diameter of a graph
- 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: Algorithms for distance problems in continuous graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312560)
