Pages that link to "Item:Q5363057"
From MaRDI portal
The following pages link to Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter (Q5363057):
Displaying 32 items.
- A fast output-sensitive algorithm for Boolean matrix multiplication (Q634680) (← links)
- Into the square: on the complexity of some quadratic-time solvable problems (Q737085) (← links)
- The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← 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)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Eccentricity queries and beyond using hub labels (Q2166770) (← 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)
- New results and open problems on subgraph centrality (Q2699851) (← 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)
- Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (Q4634027) (← links)
- (Q4638059) (← links)
- (Q4638076) (← 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)
- (Q5009621) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- An Adaptive Version of Brandes' Algorithm for Betweenness Centrality (Q5091028) (← links)
- (Q5091199) (← links)
- An Adaptive Version of Brandes' Algorithm for Betweenness Centrality (Q5131226) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)
- On computing discretized Ricci curvatures of graphs: local algorithms and (localized) fine-grained reductions (Q6076351) (← 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)
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
