{"id":"https://openalex.org/W1489660296","doi":"https://doi.org/10.1007/11561927_21","title":"Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs","display_name":"Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1489660296","doi":"https://doi.org/10.1007/11561927_21","mag":"1489660296"},"language":"en","primary_location":{"id":"doi:10.1007/11561927_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11561927_21","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ris.utwente.nl/ws/files/5313378/localMIS.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023808567","display_name":"Fabian K\u00fchn","orcid":"https://orcid.org/0000-0002-1025-5037"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Fabian Kuhn","raw_affiliation_strings":["Computer Engineering and Networks Laboratory, ETH Zurich, 8092, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Computer Engineering and Networks Laboratory, ETH Zurich, 8092, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041937385","display_name":"Thomas Moscibroda","orcid":"https://orcid.org/0000-0002-8729-7841"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Thomas Moscibroda","raw_affiliation_strings":["Computer Engineering and Networks Laboratory, ETH Zurich, 8092, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Computer Engineering and Networks Laboratory, ETH Zurich, 8092, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038202013","display_name":"Tim Nieberg","orcid":null},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Tim Nieberg","raw_affiliation_strings":["Department of Applied Mathematics, University of Twente, Postbus 217, 7500 AE, Enschede, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, University of Twente, Postbus 217, 7500 AE, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078339613","display_name":"Roger Wattenhofer","orcid":"https://orcid.org/0000-0002-6339-3134"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Roger Wattenhofer","raw_affiliation_strings":["Computer Engineering and Networks Laboratory, ETH Zurich, 8092, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Computer Engineering and Networks Laboratory, ETH Zurich, 8092, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5023808567"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":13.0341,"has_fulltext":true,"cited_by_count":126,"citation_normalized_percentile":{"value":0.99355269,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"273","last_page":"287"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9226999878883362,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9226999878883362,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.029200000688433647,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.010099999606609344,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7220845222473145},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.6384558081626892},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5856610536575317},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5614151358604431},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5357024073600769},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5295974612236023},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5219087600708008},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.515282392501831},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4766300916671753},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4578273892402649},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.45167747139930725},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43525606393814087},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4193729758262634},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.412431001663208},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.34868955612182617},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3056908845901489},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2919975817203522}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7220845222473145},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.6384558081626892},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5856610536575317},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5614151358604431},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5357024073600769},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5295974612236023},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5219087600708008},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.515282392501831},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4766300916671753},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4578273892402649},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.45167747139930725},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43525606393814087},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4193729758262634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.412431001663208},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.34868955612182617},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3056908845901489},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2919975817203522},{"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}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/11561927_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11561927_21","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/86945f65-3f2c-42ed-aa8a-393ef6e39f9f","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/86945f65-3f2c-42ed-aa8a-393ef6e39f9f","pdf_url":"https://ris.utwente.nl/ws/files/5313378/localMIS.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kuhn, F, Moscibroda, T, Nieberg, T & Wattenhofer, R 2005, Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. in P Fraigniaud (ed.), Distributed Computing: 19th International Conference, DISC 2005., 10.1007/11561927_21, Lecture Notes in Computer Science, vol. 3724, Springer, Berlin, pp. 273-283. https://doi.org/10.1007/11561927_21","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.470.4686","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.470.4686","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eprints.eemcs.utwente.nl/1686/01/localMIS.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.64.1071","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.1071","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.distcomp.ethz.ch/publications/DISC05.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.67.5288","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.5288","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.distcomp.ethz.ch/publications/DISC05.pdf","raw_type":"text"},{"id":"pmh:oai:ris.utwente.nl:publications/86945f65-3f2c-42ed-aa8a-393ef6e39f9f","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/86945f65-3f2c-42ed-aa8a-393ef6e39f9f","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/86945f65-3f2c-42ed-aa8a-393ef6e39f9f","pdf_url":"https://ris.utwente.nl/ws/files/5313378/localMIS.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kuhn, F, Moscibroda, T, Nieberg, T & Wattenhofer, R 2005, Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. in P Fraigniaud (ed.), Distributed Computing: 19th International Conference, DISC 2005., 10.1007/11561927_21, Lecture Notes in Computer Science, vol. 3724, Springer, Berlin, pp. 273-283. https://doi.org/10.1007/11561927_21","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1489660296.pdf","grobid_xml":"https://content.openalex.org/works/W1489660296.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W81816231","https://openalex.org/W100489996","https://openalex.org/W1568961751","https://openalex.org/W1855634268","https://openalex.org/W1964089073","https://openalex.org/W1964932074","https://openalex.org/W1977066974","https://openalex.org/W1982378203","https://openalex.org/W1996066664","https://openalex.org/W2000876023","https://openalex.org/W2034188144","https://openalex.org/W2053578961","https://openalex.org/W2054910423","https://openalex.org/W2064812011","https://openalex.org/W2065248207","https://openalex.org/W2067243839","https://openalex.org/W2067661972","https://openalex.org/W2100061495","https://openalex.org/W2114986147","https://openalex.org/W2127248062","https://openalex.org/W2145797586","https://openalex.org/W2147408677","https://openalex.org/W2152221608","https://openalex.org/W2165441947","https://openalex.org/W2167323208","https://openalex.org/W2169102947","https://openalex.org/W2169140571","https://openalex.org/W2583644876","https://openalex.org/W4205300528"],"related_works":["https://openalex.org/W2103112216","https://openalex.org/W1491760138","https://openalex.org/W2293112721","https://openalex.org/W2898526288","https://openalex.org/W205406847","https://openalex.org/W2607123191","https://openalex.org/W3082111916","https://openalex.org/W2798325735","https://openalex.org/W1489660296","https://openalex.org/W2113511711"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}