𝔖 Bobbio Scriptorium

✦ LIBER ✦

A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning

✍ Scribed by Spielman, Daniel A.; Teng, Shang-Hua

Book ID: 120031655
Publisher: Society for Industrial and Applied Mathematics
Year: 2013
Tongue: English
Weight: 301 KB
Volume: 42
Category: Article
ISSN: 0097-5397
DOI: 10.1137/080744888

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[ACM Press the thirty-sixth annual ACM s

[ACM Press the thirty-sixth annual ACM symposium - Chicago, IL, USA (2004.06.13-2004.06.16)] Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04 - Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems

✍ Spielman, Daniel A.; Teng, Shang-Hua 📂 Article 📅 2004 🏛 ACM Press 🌐 English ⚖ 248 KB

[ACM Press the thirty-sixth annual ACM s

[ACM Press the thirty-sixth annual ACM symposium - Chicago, IL, USA (2004.06.13-2004.06.16)] Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04 - Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems

✍ Spielman, Daniel A.; Teng, Shang-Hua 📂 Article 📅 2004 🏛 ACM Press 🌐 English ⚖ 248 KB

A time-decomposition algorithm for a sti

A time-decomposition algorithm for a stiff linear two-point boundary-value problem and its application to a nonlinear optimal control problem

✍ T. Ojika; Y. Nishikawa; M. Okudaira 📂 Article 📅 1979 🏛 Springer 🌐 English ⚖ 881 KB