Pages that link to "Item:Q5384040"
From MaRDI portal
The following pages link to Better Approximation Algorithms for the Graph Diameter (Q5384040):
Displaying 26 items.
- Better approximations of non-Hamiltonian graphs (Q1382268) (← links)
- Formally verified algorithms for upper-bounding state space diameters (Q1663245) (← links)
- A note on hardness of diameter approximation (Q1705693) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs (Q2347002) (← links)
- A faster diameter problem algorithm for a chordal graph, with a connection to its center problem (Q2659238) (← links)
- On Approximating the d-Girth of a Graph (Q3075539) (← links)
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs (Q4575605) (← links)
- (Q4638059) (← links)
- Approximating the Diameter of Planar Graphs in Near Linear Time (Q4962209) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs (Q4990395) (← links)
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- (Q5091161) (← links)
- (Q5091199) (← links)
- Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (Q5091200) (← links)
- (Q5091203) (← links)
- Succinct enumeration of distant vertex pairs (Q5207511) (← links)
- Fast and Simple Approximation of the Diameter and Radius of a Graph (Q5307536) (← links)
- Approximate proof-labeling schemes (Q5919426) (← links)
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees (Q5970916) (← links)
- Subquadratic-time algorithm for the diameter and all eccentricities on median graphs (Q6151151) (← links)
- Approximating all-points furthest pairs and maximum spanning trees in metric spaces (Q6569899) (← links)
- \( \alpha_i\)-metric graphs: radius, diameter and all eccentricities (Q6582369) (← links)