{"id":"https://openalex.org/W2011353989","doi":"https://doi.org/10.1016/0020-0190(92)90117-e","title":"A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles","display_name":"A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles","publication_year":1992,"publication_date":"1992-10-01","ids":{"openalex":"https://openalex.org/W2011353989","doi":"https://doi.org/10.1016/0020-0190(92)90117-e","mag":"2011353989"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(92)90117-e","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(92)90117-e","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},"type":"article","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/A5022573566","display_name":"Eliezer A. Albacea","orcid":null},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Eliezer A. Albacea","raw_affiliation_strings":["Department of Computer Science, Australian National University, Canberra, ACT 2601, Australia","Department of Computer Science, Australian National University, Canberra ACT 2601, Australia#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Australian National University, Canberra, ACT 2601, Australia","institution_ids":["https://openalex.org/I118347636"]},{"raw_affiliation_string":"Department of Computer Science, Australian National University, Canberra ACT 2601, Australia#TAB#","institution_ids":["https://openalex.org/I118347636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5022573566"],"corresponding_institution_ids":["https://openalex.org/I118347636"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.14535164,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"43","issue":"6","first_page":"309","last_page":"314"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.998199999332428,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9919000267982483,"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/disjoint-sets","display_name":"Disjoint sets","score":0.6195195913314819},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.5793188214302063},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.566983699798584},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5462977886199951},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5116937160491943},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.48874974250793457},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.47976669669151306},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.452437162399292},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4508242607116699},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4127964377403259},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3861787021160126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37654411792755127},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.0956014096736908}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6195195913314819},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.5793188214302063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.566983699798584},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5462977886199951},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5116937160491943},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.48874974250793457},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.47976669669151306},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.452437162399292},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4508242607116699},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4127964377403259},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3861787021160126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37654411792755127},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0956014096736908},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(92)90117-e","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(92)90117-e","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W103797413","https://openalex.org/W1766349993","https://openalex.org/W1965874601","https://openalex.org/W1974473207","https://openalex.org/W2011039300","https://openalex.org/W2013444956","https://openalex.org/W2016715486","https://openalex.org/W2016924854","https://openalex.org/W2038176627","https://openalex.org/W2042837269","https://openalex.org/W2094200127"],"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/W2152008865","https://openalex.org/W4296859768"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}