Bibliographic Information:
Current version available at http://www.arxiv.org/abs/cs.NA/0607105. Extended abstract appeared in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 81--90, 2004. This paper contains half of the material that appeared in Nearly linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
