%0 Conference Paper %1 spielman2004nearlylinear %A Spielman, D.A. %A Teng, S.H. %B Proceedings of the thirty-sixth annual ACM symposium on Theory of computing %D 2004 %K clustering conductance graph nibble partitioning %P 81--90 %T Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems %U http://scholar.google.com/scholar.bib?q=info:5gNXMrO1BVoJ:scholar.google.com/&output=citation&hl=en&as_sdt=0,5&as_vis=1&ct=citation&cd=0

@inproceedings{spielman2004nearlylinear, added-at = {2011-09-02T09:09:46.000+0200}, author = {Spielman, D.A. and Teng, S.H.}, biburl = {https://www.bibsonomy.org/bibtex/28d4b5bb434028a88170731ace671c3fe/folke}, booktitle = {Proceedings of the thirty-sixth annual ACM symposium on Theory of computing}, interhash = {e3e50ce848e6c32139bae43235db3c7f}, intrahash = {8d4b5bb434028a88170731ace671c3fe}, keywords = {clustering conductance graph nibble partitioning}, organization = {ACM}, pages = {81--90}, timestamp = {2011-09-02T09:09:47.000+0200}, title = {Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems}, url = {http://scholar.google.com/scholar.bib?q=info:5gNXMrO1BVoJ:scholar.google.com/&output=citation&hl=en&as_sdt=0,5&as_vis=1&ct=citation&cd=0}, year = 2004 }