scientific article; zbMATH DE number 1256679
From MaRDI portal
Publication:4230366
zbMATH Open0977.68562MaRDI QIDQ4230366FDOQ4230366
Authors: Noga Alon, Olded Margalit, Moni Naor, Zvi Galil 
Publication date: 20 January 2002
Title of this publication is not available (Why is that?)
Recommendations
Cited In (26)
- Subcubic equivalences between path, matrix, and triangle problems
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
- Semi-dynamic breadth-first search in digraphs
- Faster multi-witnesses for Boolean matrix multiplication
- Graph Embedding through Random Walk for Shortest Paths Problems
- Title not available (Why is that?)
- On the exponent of all pairs shortest path problem
- Title not available (Why is that?)
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
- Witnesses for Boolean matrix multiplication and for transitive closure
- Extreme witnesses and their applications
- All pairs shortest paths for graphs with small integer length edges
- On the complexity of reconstructing chemical reaction networks
- Networks cannot compute their diameter in sublinear time
- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products
- A New Combinatorial Approach for Sparse Graph Problems
- More on change-making and related problems
- Extreme witnesses and their applications
- A fast output-sensitive algorithm for Boolean matrix multiplication
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths
- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products
- Fredman's trick meets dominance product: fine-grained complexity of unweighted APSP, 3SUM counting, and more
- Packing cuts in undirected graphs
- A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs
- On minimum witnesses for Boolean matrix multiplication
- Sub-cubic cost algorithms for the all pairs shortest path problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4230366)
