Algorithms – ESA 2004

DOI10.1007/b100428zbMath1111.65301OpenAlexW2483610301MaRDI QIDQ5464618

Uri Zwick, Raphael Yuster

Publication date: 18 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100428

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Related Items (5)

Multi-view clustering on unmapped data via constrained non-negative matrix factorization ⋮ A fast output-sensitive algorithm for Boolean matrix multiplication ⋮ On dynamic shortest paths problems ⋮ Main-memory triangle computations for very large (sparse (power-law)) graphs ⋮ All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time

This page was built for publication: Algorithms – ESA 2004