{"id":"https://openalex.org/W2045107949","doi":"https://doi.org/10.1145/1007352.1007372","title":"Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems","display_name":"Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems","publication_year":2004,"publication_date":"2004-06-13","ids":{"openalex":"https://openalex.org/W2045107949","doi":"https://doi.org/10.1145/1007352.1007372","mag":"2045107949"},"language":"en","primary_location":{"id":"doi:10.1145/1007352.1007372","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007372","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061644327","display_name":"Daniel A. Spielman","orcid":"https://orcid.org/0000-0002-8958-879X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Daniel A. Spielman","raw_affiliation_strings":["M.I.T., Cambridge, MA","M.I.T., Cambridge, Ma"],"affiliations":[{"raw_affiliation_string":"M.I.T., Cambridge, MA","institution_ids":[]},{"raw_affiliation_string":"M.I.T., Cambridge, Ma","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102005063","display_name":"Shang\u2010Hua Teng","orcid":"https://orcid.org/0000-0001-5011-4514"},"institutions":[{"id":"https://openalex.org/I10734018","display_name":"Akamai (United States)","ror":"https://ror.org/03tarb191","country_code":"US","type":"company","lineage":["https://openalex.org/I10734018"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shang-Hua Teng","raw_affiliation_strings":["Boston University, Boston, MA and Akamai Technologies Inc","Boston University, Boston, MA and Akamai Technologies Inc.#TAB#"],"affiliations":[{"raw_affiliation_string":"Boston University, Boston, MA and Akamai Technologies Inc","institution_ids":[]},{"raw_affiliation_string":"Boston University, Boston, MA and Akamai Technologies Inc.#TAB#","institution_ids":["https://openalex.org/I10734018"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061644327"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":15.5577,"has_fulltext":false,"cited_by_count":795,"citation_normalized_percentile":{"value":0.99418103,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"81","last_page":"90"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-system","display_name":"Linear system","score":0.6477024555206299},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6186258792877197},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5313801169395447},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.526068389415741},{"id":"https://openalex.org/keywords/chebyshev-filter","display_name":"Chebyshev filter","score":0.4791107177734375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4513319432735443},{"id":"https://openalex.org/keywords/diagonally-dominant-matrix","display_name":"Diagonally dominant matrix","score":0.4264599084854126},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4122787117958069},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36441415548324585},{"id":"https://openalex.org/keywords/invertible-matrix","display_name":"Invertible matrix","score":0.12100791931152344}],"concepts":[{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.6477024555206299},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6186258792877197},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5313801169395447},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.526068389415741},{"id":"https://openalex.org/C21424316","wikidata":"https://www.wikidata.org/wiki/Q718621","display_name":"Chebyshev filter","level":2,"score":0.4791107177734375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4513319432735443},{"id":"https://openalex.org/C84507854","wikidata":"https://www.wikidata.org/wiki/Q952222","display_name":"Diagonally dominant matrix","level":3,"score":0.4264599084854126},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4122787117958069},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36441415548324585},{"id":"https://openalex.org/C96442724","wikidata":"https://www.wikidata.org/wiki/Q242188","display_name":"Invertible matrix","level":2,"score":0.12100791931152344},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1145/1007352.1007372","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007372","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.341.9018","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.9018","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0310051v3.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.342.3354","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.3354","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0310051v5.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.342.4272","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.4272","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0310051v8.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.342.5187","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.5187","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0310051v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.342.6495","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.6495","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0310051v4.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.342.6673","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.6673","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0310051v7.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.342.7254","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.7254","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0310051v6.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.342.790","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.790","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0310051v2.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1479829791","https://openalex.org/W1567467079","https://openalex.org/W1635293753","https://openalex.org/W1952127226","https://openalex.org/W1981859328","https://openalex.org/W1983765886","https://openalex.org/W2004283384","https://openalex.org/W2033852356","https://openalex.org/W2045107949","https://openalex.org/W2051540665","https://openalex.org/W2051573271","https://openalex.org/W2066052393","https://openalex.org/W2077791079","https://openalex.org/W2082817855","https://openalex.org/W2086486316","https://openalex.org/W2088164510","https://openalex.org/W2113679823","https://openalex.org/W2150148016","https://openalex.org/W2159000620","https://openalex.org/W2172211108","https://openalex.org/W2951548490","https://openalex.org/W6636727396"],"related_works":["https://openalex.org/W2367535589","https://openalex.org/W2348298710","https://openalex.org/W1976521968","https://openalex.org/W2351903987","https://openalex.org/W2358044860","https://openalex.org/W2137880375","https://openalex.org/W2031726779","https://openalex.org/W2293691459","https://openalex.org/W2073772681","https://openalex.org/W2952346244"],"abstract_inverted_index":{"We":[0],"present":[1],"algorithms":[2,52],"for":[3,53],"solving":[4],"symmetric,":[5],"diagonally-dominant":[6],"linear":[7,14,37],"systems":[8],"to":[9],"accuracy":[10],"\u03b5":[11],"in":[12,15],"time":[13,51],"their":[16],"number":[17,31],"of":[18,32],"non-zeros":[19],"and":[20,56],"log":[21],"(\u03baf":[22],"(A)":[23,27],"\u03b5),":[24],"where":[25],"\u03baf":[26],"is":[28],"the":[29,33,36,42],"condition":[30],"matrix":[34],"defining":[35],"system.":[38],"Our":[39],"algorithm":[40],"applies":[41],"preconditioned":[43],"Chebyshev":[44],"iteration":[45],"with":[46],"preconditioners":[47],"designed":[48],"using":[49],"nearly-linear":[50],"graph":[54,57],"sparsification":[55],"partitioning.":[58]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":18},{"year":2024,"cited_by_count":23},{"year":2023,"cited_by_count":25},{"year":2022,"cited_by_count":25},{"year":2021,"cited_by_count":55},{"year":2020,"cited_by_count":52},{"year":2019,"cited_by_count":81},{"year":2018,"cited_by_count":47},{"year":2017,"cited_by_count":41},{"year":2016,"cited_by_count":50},{"year":2015,"cited_by_count":55},{"year":2014,"cited_by_count":56},{"year":2013,"cited_by_count":49},{"year":2012,"cited_by_count":44}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}