Computing and Combinatorics
From MaRDI portal
Publication:5716965
DOI10.1007/11533719zbMath1128.68553OpenAlexW4376561447MaRDI QIDQ5716965
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11533719
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items (4)
Mantaining dynamic matrices for fully dynamic transitive closure ⋮ Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs ⋮ A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
This page was built for publication: Computing and Combinatorics
