93 citations · 244 across the 16 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012★ 1 cited
Faster spectral sparsification and numerical algorithms for SDD matrices
Ioannis Koutis, Alex Levin, Richard Peng
We study algorithms for spectral graph sparsification. The input is a graph with vertices and edges, and the output is a sparse graph that approximates …
cs.DS2012★ 30 cited
Constrained multilinear detection for faster functional motif discovery
Ioannis Koutis
The GRAPH MOTIF problem asks whether a given multiset of colors appears on a connected subgraph of a vertex-colored graph. The fastest known parameterized algorithm for this proble…