Pages that link to "Item:Q4575605"
From MaRDI portal
The following pages link to Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs (Q4575605):
Displaying 10 items.
- Continuous mean distance of a weighted graph (Q6045116) (← links)
- The diameter of AT‐free graphs (Q6057658) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
- Computation of diameter, radius and center of permutation graphs (Q6115743) (← links)
- Graphs with \(G^p\)-connected medians (Q6120939) (← 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)
- Parameterized complexity of streaming diameter and connectivity problems (Q6614110) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q6671670) (← links)