{"id":"https://openalex.org/W2029386996","doi":"https://doi.org/10.1142/s0129626496000315","title":"PARALLEL EDGE COLORING APPROXIMATION","display_name":"PARALLEL EDGE COLORING APPROXIMATION","publication_year":1996,"publication_date":"1996-09-01","ids":{"openalex":"https://openalex.org/W2029386996","doi":"https://doi.org/10.1142/s0129626496000315","mag":"2029386996"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626496000315","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626496000315","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel 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/A5052643589","display_name":"Martin F\u00fcrer","orcid":"https://orcid.org/0000-0001-5354-3226"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"MARTIN F\u00dcRER","raw_affiliation_strings":["Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA 16802, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA 16802, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046140110","display_name":"Balaji Raghavachari","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"BALAJI RAGHAVACHARI","raw_affiliation_strings":["Department of Computer Science, The University of Texas at Dallas, Box 830688, Richardson, TX 75083\u20130688, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Texas at Dallas, Box 830688, Richardson, TX 75083\u20130688, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.15716108,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"06","issue":"03","first_page":"321","last_page":"329"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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.9987000226974487,"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.9649999737739563,"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.9609000086784363,"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.7445422410964966},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6843571066856384},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6031315326690674},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.5479434132575989},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4906422197818756},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45864349603652954},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4546036124229431},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44980257749557495},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.44179508090019226},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.42774567008018494},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36644160747528076},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3424798250198364},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3256780505180359},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10087761282920837},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.055914729833602905}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7445422410964966},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6843571066856384},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6031315326690674},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.5479434132575989},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4906422197818756},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45864349603652954},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4546036124229431},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44980257749557495},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.44179508090019226},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.42774567008018494},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36644160747528076},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3424798250198364},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3256780505180359},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10087761282920837},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.055914729833602905},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"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":2,"locations":[{"id":"doi:10.1142/s0129626496000315","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626496000315","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.132.8096","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.8096","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.utdallas.edu/~rbk/papers/edgeColoring.ps.gz","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W2047234016","https://openalex.org/W2052169362","https://openalex.org/W2380525562","https://openalex.org/W1608733163","https://openalex.org/W4291316360","https://openalex.org/W2163432100"],"abstract_inverted_index":{"Let":[0],"G":[1,27,62,110],"be":[2,16,34,70,112],"a":[3,22,47,57,92,106,126],"graph":[4],"with":[5,102],"n":[6,39,118],"vertices":[7],"and":[8,11],"m":[9],"edges":[10],"let":[12],"its":[13],"maximum":[14],"degree":[15],"\u0394.":[17],"It":[18],"is":[19,88],"shown":[20],"that":[21,86],"valid":[23,58],"edge":[24,59],"coloring":[25,60,95],"of":[26,109],"using":[28,43,63,78,122],"at":[29,64],"most":[30,65],"2\u0394\u22121":[31],"colors":[32,68],"can":[33,69,111],"computed":[35,71,113],"in":[36,72,96,114],"O(":[37,73,97,115],"log":[38,40,74,98,116,119],"\u0394)":[41,120],"time":[42,121],"O(m+n)":[44,79,103,123],"processors":[45,124],"on":[46,51,125],"CREW":[48,127],"PRAM.":[49,128],"Based":[50],"this,":[52],"for":[53,61],"any":[54],"constant":[55],"c>1,":[56],"max([c\u0394],":[66],"\u0394+1)":[67],"2":[75,94,117],"n)":[76,100],"time,":[77,101],"processors.":[80,104],"Employing":[81],"different":[82],"techniques,":[83],"we":[84],"show":[85],"it":[87],"possible":[89],"to":[90],"compute":[91],"\u0394":[93],"*":[99],"Also,":[105],"maximal":[107],"matching":[108]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}