Pages that link to "Item:Q5495822"
From MaRDI portal
The following pages link to Fast approximation algorithms for the diameter and radius of sparse graphs (Q5495822):
Displaying 17 items.
- Fast and Simple Approximation of the Diameter and Radius of a Graph (Q5307536) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
- (Q5875468) (← links)
- Approximate proof-labeling schemes (Q5919426) (← links)
- Parameterized complexity of diameter (Q5925618) (← links)
- Continuous mean distance of a weighted graph (Q6045116) (← links)
- The diameter of AT‐free graphs (Q6057658) (← links)
- A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs (Q6075716) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
- Interpretable random forest model for identification of edge 3-uncolorable cubic graphs (Q6125138) (← links)
- Subquadratic-time algorithm for the diameter and all eccentricities on median graphs (Q6151151) (← links)
- Computing and listing avoidable vertices and paths (Q6185944) (← links)
- The energy complexity of diameter and minimum cut computation in bounded-genus networks (Q6199403) (← links)
- \( \alpha_i\)-metric graphs: radius, diameter and all eccentricities (Q6582369) (← links)
- Parameterized complexity of streaming diameter and connectivity problems (Q6614110) (← links)
- Determining chromatic index of cubic graph with the use of explainable classifiers: a comparative study (Q6671115) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q6671670) (← links)
