HackerPapers

arXiv:cs/0310051cs.DS

Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems

Daniel A. Spielman, Shang-Hua Teng

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

This paper has been divided into three papers. arXiv:0809.3232, arXiv:0808.4134, arXiv:cs/0607105

arXiv comments
withdrawn by author
Journal reference
DOI
Subjects
cs.DSData Structures and Algorithms math.NANumerical Analysis

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jun 2024 to Jun 2024.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Researchers develop the fastest possible flow algorithm 1 comment

    • Interestingly, the same guy also works on making 'theory-only' algorithms work well in practice [1]. But, it seems like that takes another 20 years -- [1] is building on a theory breakthrough from 2004 [2], but these algorithms are only starting to work in practice in 2024…

      okintheoryView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.