Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Daniel A. Spielman, Shang-Hua Teng
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
STOC, 2004.

STOC 2004
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-2004-SpielmanT,
	author        = "Daniel A. Spielman and Shang-Hua Teng",
	booktitle     = "{Proceedings of the 36th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/1007352.1007372",
	isbn          = "1-58113-852-0",
	pages         = "81--90",
	publisher     = "{ACM}",
	title         = "{Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems}",
	year          = 2004,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.