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 50 items.
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings (Q266919) (← links)
- Into the square: on the complexity of some quadratic-time solvable problems (Q737085) (← links)
- Multivariate analysis of orthogonal range searching and graph distances (Q786041) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q827313) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869) (← links)
- Formally verified algorithms for upper-bounding state space diameters (Q1663245) (← links)
- A note on hardness of diameter approximation (Q1705693) (← links)
- Hardness of RNA folding problem with four symbols (Q1711829) (← links)
- An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time (Q2011037) (← links)
- Compact distributed certification of planar graphs (Q2037111) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Eccentricity queries and beyond using hub labels (Q2166770) (← links)
- Fast diameter computation within split graphs (Q2180143) (← links)
- Eccentricity terrain of \(\delta\)-hyperbolic graphs (Q2186812) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
- Tight conditional lower bounds for longest common increasing subsequence (Q2272597) (← links)
- Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs (Q2347002) (← links)
- A note on the complexity of computing the number of reachable vertices in a digraph (Q2629773) (← links)
- A faster diameter problem algorithm for a chordal graph, with a connection to its center problem (Q2659238) (← links)
- Beyond Helly graphs: the diameter problem on absolute retracts (Q2672446) (← links)
- Distance problems within Helly graphs and \(k\)-Helly graphs (Q2682928) (← links)
- Computing Giant Graph Diameters (Q2819520) (← links)
- Linear-time graph distance and diameter approximation (Q2827756) (← links)
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) (Q4268701) (← links)
- Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False) (Q4571928) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs (Q4575605) (← links)
- (Q4638059) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy (Q4993299) (← links)
- Tighter connections between Formula-SAT and shaving logs (Q5002674) (← links)
- Multivariate analysis of orthogonal range searching and graph distances (Q5009466) (← links)
- Fine-grained Lower Bounds on Cops and Robbers (Q5009566) (← links)
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
- Fast Diameter Computation within Split Graphs (Q5024674) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- The Orthogonal Vectors Conjecture for Branching Programs and Formulas (Q5090426) (← links)
- Fine-Grained Complexity Theory (Tutorial) (Q5090450) (← links)
- (Q5091021) (← links)
- (Q5091161) (← links)
- (Q5091199) (← links)
- Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (Q5091200) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- (Q5111874) (← links)
- (Q5116490) (← links)
- (Q5121902) (← links)
- (Q5136259) (← links)
- On the hardness of approximate and exact (bichromatic) maximum inner product (Q5140838) (← links)
