{"id":"https://openalex.org/W2151690061","doi":"https://doi.org/10.1145/2312005.2312058","title":"Greedy sequential maximal independent set and matching are parallel on average","display_name":"Greedy sequential maximal independent set and matching are parallel on average","publication_year":2012,"publication_date":"2012-06-25","ids":{"openalex":"https://openalex.org/W2151690061","doi":"https://doi.org/10.1145/2312005.2312058","mag":"2151690061"},"language":"en","primary_location":{"id":"doi:10.1145/2312005.2312058","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2312005.2312058","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures","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/A5033930662","display_name":"Guy E. Blelloch","orcid":"https://orcid.org/0000-0003-0224-9187"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guy E. Blelloch","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011772692","display_name":"Jeremy T. Fineman","orcid":"https://orcid.org/0009-0000-7483-4532"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeremy T. Fineman","raw_affiliation_strings":["Georgetown University, Washington, D.C., DC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, D.C., DC, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051583907","display_name":"Julian Shun","orcid":"https://orcid.org/0000-0001-6163-6625"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Julian Shun","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.5569,"has_fulltext":false,"cited_by_count":119,"citation_normalized_percentile":{"value":0.96381806,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"308","last_page":"317"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9991999864578247,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.89957594871521},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7992497682571411},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5751208066940308},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5501934289932251},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5143347978591919},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.48962265253067017},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47050875425338745},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44763973355293274},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.4333629012107849},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4135347604751587},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4134054481983185},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.41075581312179565},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35651010274887085},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.203184574842453},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.0757409930229187}],"concepts":[{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.89957594871521},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7992497682571411},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5751208066940308},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5501934289932251},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5143347978591919},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.48962265253067017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47050875425338745},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44763973355293274},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.4333629012107849},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4135347604751587},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4134054481983185},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.41075581312179565},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35651010274887085},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.203184574842453},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0757409930229187},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2312005.2312058","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2312005.2312058","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.363.6260","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.6260","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~jshun/mis.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.752.1463","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.752.1463","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/1202.3205.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1482680420","https://openalex.org/W1497287285","https://openalex.org/W1507039213","https://openalex.org/W1931688030","https://openalex.org/W1964089073","https://openalex.org/W1964932074","https://openalex.org/W1968067819","https://openalex.org/W1979201594","https://openalex.org/W1997802297","https://openalex.org/W2017205387","https://openalex.org/W2033177550","https://openalex.org/W2071134069","https://openalex.org/W2073975876","https://openalex.org/W2100061495","https://openalex.org/W2110963759","https://openalex.org/W2151636922","https://openalex.org/W2169102947","https://openalex.org/W2752885492","https://openalex.org/W3104921985","https://openalex.org/W3145128584","https://openalex.org/W3157585079"],"related_works":["https://openalex.org/W3003449463","https://openalex.org/W2963989216","https://openalex.org/W2804969619","https://openalex.org/W4301100693","https://openalex.org/W2574748442","https://openalex.org/W2964258819","https://openalex.org/W2742166337","https://openalex.org/W4297693688","https://openalex.org/W2293112721","https://openalex.org/W4312793153"],"abstract_inverted_index":{"The":[0],"greedy":[1],"sequential":[2,41,121],"algorithm":[3],"for":[4],"maximal":[5],"independent":[6],"set":[7,23],"(MIS)":[8],"loops":[9],"over":[10],"the":[11,21,52,67,86,95,104,110,120],"vertices":[12],"in":[13,39,66,106],"an":[14,115],"arbitrary":[15],"order":[16],"adding":[17],"a":[18,49,61,91],"vertex":[19,31],"to":[20,79,90,114],"resulting":[22],"if":[24,27],"and":[25],"only":[26,46],"no":[28,74],"previous":[29,53,63,75],"neighboring":[30],"has":[32,73],"been":[33],"added.":[34],"In":[35],"this":[36,98],"loop,":[37],"as":[38],"many":[40],"loops,":[42],"each":[43],"iterate":[44],"will":[45],"depend":[47],"on":[48],"subset":[50],"of":[51,60],"iterates":[54,105],"(i.e.":[55],"knowing":[56,70],"that":[57,71],"any":[58],"one":[59,83],"vertex's":[62],"neighbors":[64],"is":[65,77,100],"MIS,":[68],"or":[69,85],"it":[72],"neighbors,":[76],"sufficient":[78],"decide":[80],"its":[81],"fate":[82],"way":[84],"other).":[87],"This":[88],"leads":[89],"dependence":[92],"structure":[93,99],"among":[94],"iterates.":[96],"If":[97],"shallow":[101],"then":[102],"running":[103],"parallel":[107,117],"while":[108],"respecting":[109],"dependencies":[111],"can":[112],"lead":[113],"efficient":[116],"implementation":[118],"mimicking":[119],"algorithm.":[122]},"counts_by_year":[{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":22},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}