Image de couverture de livre

Diameter Computation on (Random) Geometric Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bläsius, Thomas, Schaub, Annemarie, Wilhelm, Marcus
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the External Validity of Average-Case Analyses of Graph Algorithms
par: Bläsius, Thomas, et autres
Publié: (2022)

Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher
par: Chan, Timothy M., et autres
Publié: (2026)

Online Matching in Geometric Random Graphs
par: Sentenac, Flore, et autres
Publié: (2023)

Diameter Shortcut Sets on Temporal Graphs
par: Quantmeyer, Gerome
Publié: (2025)

Structure and Independence in Hyperbolic Uniform Disk Graphs
par: Bläsius, Thomas, et autres
Publié: (2024)

Better Diameter Algorithms for Bounded VC-dimension Graphs and Geometric Intersection Graphs
par: Duraj, Lech, et autres
Publié: (2023)

Flow-weighted Layered Metric Euclidean Capacitated Steiner Tree Problem
par: Bläsius, Thomas, et autres
Publié: (2025)

Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter
par: Chalermsook, Parinya, et autres
Publié: (2021)

Computing Diameter +1 in Truly Subquadratic Time for Unit-Disk Graphs
par: Chang, Hsien-Chih, et autres
Publié: (2024)

Stronger Directed Low-Diameter Decompositions with Sub-Logarithmic Diameter and Separation
par: Haeupler, Bernhard, et autres
Publié: (2025)

Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router Decomposition
par: Chuzhoy, Julia, et autres
Publié: (2026)

Uniform Sampling of Negative Edge Weights in Shortest Path Networks
par: Geis, Lukas, et autres
Publié: (2024)

Going Beyond Surfaces in Diameter Approximation
par: Włodarczyk, Michał
Publié: (2025)

Fault-Tolerant ST-Diameter Oracles
par: Bilò, Davide, et autres
Publié: (2023)

Streaming Diameter of High-Dimensional Points
par: Halldórsson, Magnús M., et autres
Publié: (2025)

Faster optimal univariate microgaggregation
par: Stamm, Felix I., et autres
Publié: (2024)

An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
par: Xu, Chao, et autres
Publié: (2026)

Near-Optimal Directed Low-Diameter Decompositions
par: Bringmann, Karl, et autres
Publié: (2025)

FPT approximations for Capacitated Sum of Radii and Diameters
par: Filtser, Arnold, et autres
Publié: (2024)

Simpler and Faster Directed Low-Diameter Decompositions
par: Li, Jason
Publié: (2025)

New Diameter Approximations via Distance Oracle Techniques
par: Kirkpatrick, Yael, et autres
Publié: (2026)

Log Diameter Rounds MST Verification and Sensitivity in MPC
par: Coy, Sam, et autres
Publié: (2024)

Dynamic Diameter in High-Dimensions against Adaptive Adversary and Beyond
par: Banihashem, Kiarash, et autres
Publié: (2025)

Better Diameter Bounds for Efficient Shortcuts and a Structural Criterion for Constructiveness
par: Haeupler, Bernhard, et autres
Publié: (2026)

Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii
par: Friggstad, Zachary, et autres
Publié: (2024)

Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions
par: Li, Jason, et autres
Publié: (2025)

Bounding Width on Graph Classes of Constant Diameter
par: Dabrowski, Konrad K., et autres
Publié: (2025)

Recovering Communities in Structured Random Graphs
par: Kapralov, Michael, et autres
Publié: (2026)

Weighted Embeddings for Low-Dimensional Graph Representation
par: Bläsius, Thomas, et autres
Publié: (2024)

A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
par: Zhou, Yi, et autres
Publié: (2025)

The General Expiration Streaming Model: Diameter, $k$-Center, Counting, Sampling, and Friends
par: Blank, Lotte, et autres
Publié: (2025)

Reconstructing Riemannian Metrics From Random Geometric Graphs
par: Huang, Han, et autres
Publié: (2025)

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation
par: Bläsius, Thomas, et autres
Publié: (2024)

Estimating Random-Walk Probabilities in Directed Graphs
par: Bertram, Christian, et autres
Publié: (2025)

Computing k-mers in Graphs
par: Alanko, Jarno N., et autres
Publié: (2025)

Improved fixed-parameter bounds for Min-Sum-Radii and Diameters $k$-clustering and their fair variants
par: Banerjee, Sandip, et autres
Publié: (2025)

Sublinear Random Access Generators for Preferential Attachment Graphs
par: Even, Guy, et autres
Publié: (2016)

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
par: Chan, Timothy M., et autres
Publié: (2025)

Practical Computation of Graph VC-Dimension
par: Coudert, David, et autres
Publié: (2024)

On Strong Diameter Padded Decompositions
par: Filtser, Arnold
Publié: (2019)