All-pairs bottleneck paths in vertex weighted graphs
type: Item
instance of: scholarly article
title: All-pairs bottleneck paths in vertex weighted graphs
zbMATH Open document ID: 1211.05168
author: Asaf Shapira
author: Raphael Yuster
author: Uri Zwick
published in: Algorithmica
publication date: 2011-03-30T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5871675
zbMATH Keywords: bottleneck paths
zbMATH Keywords: shortest paths
zbMATH Keywords: directed weighted graphs
MaRDI profile type: Publication
full work available at URL: s00453-009-9328-x
OpenAlex ID: W3137337592
cites work: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
cites work: Lowest common ancestors in trees and directed acyclic graphs
cites work: Introduction to algorithms
cites work: Rectangular matrix multiplication revisited
cites work: Matrix multiplication via arithmetic progressions
cites work: Faster algorithms for finding lowest common ancestors in directed acyclic graphs
cites work: Q2934691
cites work: Q5616737
cites work: Witnesses for Boolean matrix multiplication and for transitive closure
cites work: Algorithms for two bottleneck optimization problems
cites work: Fast rectangular matrix multiplication and applications
cites work: Automata, Languages and Programming
cites work: Efficient determination of the transitive closure of a directed graph
cites work: On the all-pairs-shortest-path problem in unweighted undirected graphs.
cites work: Finding a maximum weight triangle in n 3-Δ time, with applications
cites work: Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems
cites work: Q3549658
cites work: All pairs lightest shortest paths
cites work: Q4796165
cites work: All pairs shortest paths using bridging sets and rectangular matrix multiplication
DOI: 10.1007/S00453-009-9328-X
Recommended article: Q2934690
Recommended article: More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
Recommended article: On the all-pairs-shortest-path problem in unweighted undirected graphs.
Recommended article: All-Pairs Almost Shortest Paths
Recommended article: A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs
Recommended article: All-pairs shortest paths and the essential subgraph
Recommended article: An all-pairs shortest path algorithm for bipartite graphs
Recommended article: A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs.
Recommended article: A new approach to all-pairs shortest paths on real-weighted graphs
Recommended article: All-pairs shortest paths for unweighted undirected graphs in o ( mn ) time
description: scientific article; zbMATH DE number 5871675