Pages that link to "Item:Q4575605"

The following pages link to Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs (Q4575605):

Displaying 50 items.

• 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)
• The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
• Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
• Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
• An efficient noisy binary search in graphs via Median approximation (Q2115863) (← links)
• Medians in median graphs and their cube complexes in linear time (Q2119403) (← links)
• Scheduling lower bounds via AND subset sum (Q2121467) (← links)
• Eccentricity queries and beyond using hub labels (Q2166770) (← links)
• Parameterized analysis and crossing minimization problems (Q2172859) (← links)
• Eccentricity terrain of \(\delta\)-hyperbolic graphs (Q2186812) (← links)
• Improved distance queries and cycle counting by Frobenius normal form (Q2321929) (← links)
• Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← 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)
• A linear-time parameterized algorithm for computing the width of a DAG (Q2672441) (← 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)
• On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140) (← links)
• Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
• The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments (Q4632200) (← 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)
• (Q4993299) (← links)
• (Q5002674) (← links)
• (Q5009466) (← 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)
• (Q5088945) (← links)
• The Orthogonal Vectors Conjecture for Branching Programs and Formulas (Q5090426) (← links)
• (Q5091161) (← links)
• (Q5091199) (← links)
• Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (Q5091200) (← links)
• (Q5091230) (← links)
• A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
• (Q5136259) (← links)
• Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
• (Q5875463) (← links)
• Minimum Cuts in Surface Graphs (Q5885599) (← links)
• Parameterized aspects of triangle enumeration (Q5915757) (← links)
• Parameterized approximation algorithms for some location problems in graphs (Q5915898) (← links)
• When can graph hyperbolicity be computed in linear time? (Q5915992) (← links)
• Parameterized complexity of diameter (Q5925618) (← links)
• Continuous mean distance of a weighted graph (Q6045116) (← links)
• The diameter of AT‐free graphs (Q6057658) (← links)