1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2024★ 1 cited
Expander Hierarchies for Normalized Cuts on Graphs
Kathrin Hanauer, Monika Henzinger, Robin Münk +2
Expander decompositions of graphs have significantly advanced the understanding of many classical graph problems and led to numerous fundamental theoretical results. However, their…
cs.DS2023
Fast -Approximation Algorithms for Binary Matrix Factorization
Ameya Velingker, Maximilian Vötsch, David P. Woodruff +1
We introduce efficient -approximation algorithms for the binary matrix factorization (BMF) problem, where the inputs are a matrix $\mathbf{A}\in\{0,1\}^{n\times d}…