Algorithms – ESA 2004
From MaRDI portal
Publication:5464618
DOI10.1007/b100428zbMath1111.65301MaRDI QIDQ5464618
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
65F50: Computational methods for sparse matrices
Related Items
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, Multi-view clustering on unmapped data via constrained non-negative matrix factorization, All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time