default search action

combined dblp search
author search
venue search
publication search

ask others

"Nearly-linear time algorithms for graph partitioning, graph ..."

Daniel A. Spielman, Shang-Hua Teng (2004)

> Home

Details and statistics

DOI: 10.1145/1007352.1007372

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/SpielmanT04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/SpielmanT04
Daniel A. Spielman, Shang-Hua Teng:
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. STOC 2004: 81-90

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.