{"id":"https://openalex.org/W2126089949","doi":"https://doi.org/10.1007/978-3-642-39212-2_59","title":"Fast Distributed Coloring Algorithms for Triangle-Free Graphs","display_name":"Fast Distributed Coloring Algorithms for Triangle-Free Graphs","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2126089949","doi":"https://doi.org/10.1007/978-3-642-39212-2_59","mag":"2126089949"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-39212-2_59","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-39212-2_59","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Seth Pettie","raw_affiliation_strings":["University of Michigan, USA","(University of Michigan)"],"affiliations":[{"raw_affiliation_string":"University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"(University of Michigan)","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102739300","display_name":"Hsin-Hao Su","orcid":"https://orcid.org/0000-0003-3838-8349"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hsin-Hao Su","raw_affiliation_strings":["University of Michigan, USA","(University of Michigan)"],"affiliations":[{"raw_affiliation_string":"University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"(University of Michigan)","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076564426"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.4506,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.893083,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"681","last_page":"693"},"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.9997000098228455,"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.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.996399998664856,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.807163655757904},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4884602129459381},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.48695170879364014},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46550849080085754},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4540688395500183},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.43175801634788513},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.43001365661621094},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.4297979176044464},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3891998529434204},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08463466167449951},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.07989245653152466}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.807163655757904},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4884602129459381},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.48695170879364014},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46550849080085754},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4540688395500183},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43175801634788513},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.43001365661621094},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.4297979176044464},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3891998529434204},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08463466167449951},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.07989245653152466},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-642-39212-2_59","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-39212-2_59","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:CiteSeerX.psu:10.1.1.352.6859","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.352.6859","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.eecs.umich.edu/~pettie/papers/triangle-free.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.650.6533","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.650.6533","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.eecs.umich.edu/~hsinhao/triangle_free.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/c3f667f5-9c33-457f-aac9-16455704ec0a","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/c3f667f5-9c33-457f-aac9-16455704ec0a","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pettie, S & Su, H-H 2013, Fast distributed coloring algorithms for triangle-free graphs. in F Fomin, R Freivalds, M Kwiatkowska & D Peleg (eds), Automata, Languages, and Programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II. Springer Publishing Company, Lecture Notes in Computer Science, vol. 7966, pp. 681-693, International Colloquium on Automata, Languages, and Programming, Riga, Latvia, 08/07/2013. https://doi.org/10.1007/978-3-642-39212-2_59","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W15909752","https://openalex.org/W345637930","https://openalex.org/W1494123813","https://openalex.org/W1543445673","https://openalex.org/W1552211935","https://openalex.org/W1568961751","https://openalex.org/W1998643836","https://openalex.org/W2022155283","https://openalex.org/W2022392080","https://openalex.org/W2022743540","https://openalex.org/W2034499376","https://openalex.org/W2036489778","https://openalex.org/W2044427170","https://openalex.org/W2048800330","https://openalex.org/W2053777090","https://openalex.org/W2054040057","https://openalex.org/W2054910423","https://openalex.org/W2080547399","https://openalex.org/W2085716675","https://openalex.org/W2102699055","https://openalex.org/W2109693504","https://openalex.org/W2119305988","https://openalex.org/W2119761906","https://openalex.org/W2149135074","https://openalex.org/W2152427009","https://openalex.org/W2157562188","https://openalex.org/W2161176300","https://openalex.org/W2607541376","https://openalex.org/W2953271509","https://openalex.org/W4205300528","https://openalex.org/W4210634265","https://openalex.org/W4251499437","https://openalex.org/W4292027191"],"related_works":["https://openalex.org/W2380525562","https://openalex.org/W4291316360","https://openalex.org/W2163432100","https://openalex.org/W3169197204","https://openalex.org/W1542397451","https://openalex.org/W4229747356","https://openalex.org/W4311345810","https://openalex.org/W3187209459","https://openalex.org/W4296859768","https://openalex.org/W3083598767"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}