scientific article; zbMATH DE number 7561539
From MaRDI portal
Publication:5091199
DOI10.4230/LIPIcs.ICALP.2019.46MaRDI QIDQ5091199
Nikhil Vyas, Mina Dalirrooyfard, Yinzhan Xu, Nicole Wein, Yuancheng Yu, Virginia Vassilevska Williams
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1904.11606
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs
- Efficient algorithms for center problems in cactus networks
- All-pairs shortest paths for unweighted undirected graphs in o ( mn ) time
- Faster Approximation of Distances in Graphs
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- The absolute center of a network
- Subgraph Isomorphism in Planar Graphs and Related Problems
- New Bounds for Approximating Extremal Distances in Undirected Graphs
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- Towards tight approximation bounds for graph diameter and eccentricities
- Faster all-pairs shortest paths via circuit complexity
- A Shortest Path Algorithm for Real-Weighted Undirected Graphs
- Approximating the Diameter of Planar Graphs in Near Linear Time
- Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
- Better Approximation Algorithms for the Graph Diameter
- Fast approximation algorithms for the diameter and radius of sparse graphs
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Diameter determination on restricted graph families
This page was built for publication:
