Pages that link to "Item:Q737085"

The following pages link to Into the square: on the complexity of some quadratic-time solvable problems (Q737085):

Displaying 22 items.

• Into the square: on the complexity of some quadratic-time solvable problems (Q737085) (← links)
• Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869) (← links)
• Computing the union join and subset graph of acyclic hypergraphs in subquadratic time (Q832905) (← links)
• Eccentricity queries and beyond using hub labels (Q2166770) (← links)
• Non-inclusion and other subclasses of chordal graphs (Q2283105) (← links)
• Applying clique-decomposition for computing Gromov hyperbolicity (Q2399620) (← 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)
• Fast approximation and exact computation of negative curvature parameters of graphs (Q2664113) (← links)
• Beyond Helly graphs: the diameter problem on absolute retracts (Q2672446) (← links)
• A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs (Q2672614) (← links)
• Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
• Revisiting Decomposition by Clique Separators (Q4610181) (← 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)
• 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)
• Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs (Q5115790) (← links)
• (Q5874488) (← links)
• When can graph hyperbolicity be computed in linear time? (Q5915992) (← links)
• The diameter of AT‐free graphs (Q6057658) (← links)
• A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)