MathSciNet Relay Station
MathSciNet bibliographic data
MR2121588 (2005i:05188) 05C85 (05C70 15A06 65F30 68R10)
Spielman, Daniel A.; Teng, Shang-Hua Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 81–90 (electronic), ACM, New York, 2004.
For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page

American Mathematical Society American Mathematical Society
201 Charles Street
Providence, RI 02904-6248 USA
© Copyright 2015, American Mathematical Society
Privacy Statement