165 citations · 950 across the 71 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011★ 5 cited
Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications
Noga Alon, Ankur Moitra, Benny Sudakov
We describe two constructions of (very) dense graphs which are edge disjoint unions of large {\em induced} matchings. The first construction exhibits graphs on vertices with ${…
cs.DS2011★ 7 cited
Computing a Nonnegative Matrix Factorization -- Provably
Sanjeev Arora, Rong Ge, Ravi Kannan +1
In the Nonnegative Matrix Factorization (NMF) problem we are given an nonnegative matrix and an integer . Our goal is to express as where and…