Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs

08/31/2018
by   Ran Duan, et al.
0

In a directed graph G=(V,E) with a capacity on every edge, a bottleneck path (or widest path) between two vertices is a path maximizing the minimum capacity of edges in the path. For the single-source all-destination version of this problem in directed graphs, the previous best algorithm runs in O(m+n n) (m=|E| and n=|V|) time, by Dijkstra search with Fibonacci heap [Fredman and Tarjan 1987]. We improve this time bound to O(m√( n)), thus it is the first algorithm which breaks the time bound of classic Fibonacci heap when m=o(n√( n)). It is a Las-Vegas randomized approach. By contrast, the s-t bottleneck path has an algorithm with running time O(mβ(m,n)) [Chechik et al. 2016], where β(m,n)={k≥ 1: ^(k)n≤m/n}.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/11/2018

Subexponential-time Algorithms for Maximum Independent Set in P_t-free and Broom-free Graphs

In algorithmic graph theory, a classic open question is to determine the...
research
02/26/2020

On Learning a Hidden Directed Graph with Path Queries

In this paper, we consider the problem of reconstructing a directed grap...
research
12/27/2021

Quantum Algorithm for the Longest Trail Problem

We present the quantum algorithm for the Longest Trail Problem. The prob...
research
12/18/2019

Busca de melhor caminho entre múltiplas origens e múltiplos destinos em redes complexas que representam cidades

Was investigated in this paper the use of a search strategy in the probl...
research
07/06/2019

A Randomized Algorithm for Edge-Colouring Graphs in O(m√(n)) Time

We present a simple randomized algorithm to edge-colour arbitrary simple...
research
11/17/2022

Minimum Path Cover in Parameterized Linear Time

A minimum path cover (MPC) of a directed acyclic graph (DAG) G = (V,E) i...
research
05/10/2020

Improved Bi-criteria Approximation for the All-or-Nothing Multicommodity Flow Problem in Arbitrary Networks

This paper addresses the following fundamental maximum throughput routin...

Please sign up or login with your details

Forgot password? Click here to reset