Deterministic performance guarantees for bidirectional BFS on real-world networks

DOI10.1007/978-3-031-34347-6_9arXiv2209.15300OpenAlexW4379117882MaRDI QIDQ6182895

Marcus Wilhelm, Thomas Bläsius

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.15300

zbMATH Keywords

scale-free networksbidirectional BFSbidirectional shortest pathsdistribution-free analysis

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs
• KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
• Distribution-Free Models of Social Networks
• Finding Cliques in Social Networks: A New Distribution-Free Model
• Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry

This page was built for publication: Deterministic performance guarantees for bidirectional BFS on real-world networks