Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 7-Day Trial for You or Your Team.

Learn More →

Graph Clustering Via a Discrete Uncoupling Process

Graph Clustering Via a Discrete Uncoupling Process http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png SIAM Journal on Matrix Analysis and Applications CrossRef

Graph Clustering Via a Discrete Uncoupling Process

SIAM Journal on Matrix Analysis and Applications , Volume 30 (1): 121-141 – Jan 1, 2008

Graph Clustering Via a Discrete Uncoupling Process

SIAM Journal on Matrix Analysis and Applications , Volume 30 (1): 121-141 – Jan 1, 2008

Loading next page...
 
/lp/crossref/graph-clustering-via-a-discrete-uncoupling-process-803xmDUQkB

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
CrossRef
ISSN
0895-4798
DOI
10.1137/040608635
Publisher site
See Article on Publisher Site

Abstract

Journal

SIAM Journal on Matrix Analysis and ApplicationsCrossRef

Published: Jan 1, 2008

There are no references for this article.