scientific article; zbMATH DE number 1256679

zbMath0977.68562MaRDI QIDQ4230366

Moni Naor, Olded Margalit, Noga Alon, Zvi Galil

Publication date: 20 January 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (18)

A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs ⋮ Quantum and approximation algorithms for maximum witnesses of Boolean matrix products ⋮ Packing cuts in undirected graphs ⋮ All pairs shortest paths for graphs with small integer length edges ⋮ On the exponent of all pairs shortest path problem ⋮ Extreme Witnesses and Their Applications ⋮ Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions ⋮ Sub-cubic cost algorithms for the all pairs shortest path problem ⋮ Unnamed Item ⋮ A fast output-sensitive algorithm for Boolean matrix multiplication ⋮ On the complexity of reconstructing chemical reaction networks ⋮ Faster multi-witnesses for Boolean matrix multiplication ⋮ Extreme witnesses and their applications ⋮ More on change-making and related problems ⋮ Graph Embedding through Random Walk for Shortest Paths Problems ⋮ Semi-dynamic breadth-first search in digraphs ⋮ Unnamed Item ⋮ A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots

This page was built for publication: