{"id":"https://openalex.org/W2120729889","doi":"https://doi.org/10.1137/0211009","title":"Algorithms for Edge Coloring Bipartite Graphs and Multigraphs","display_name":"Algorithms for Edge Coloring Bipartite Graphs and Multigraphs","publication_year":1982,"publication_date":"1982-02-01","ids":{"openalex":"https://openalex.org/W2120729889","doi":"https://doi.org/10.1137/0211009","mag":"2120729889"},"language":"en","primary_location":{"id":"doi:10.1137/0211009","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211009","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5001013961","display_name":"Harold N. Gabow","orcid":"https://orcid.org/0000-0002-9775-3492"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Harold N. Gabow","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5006771843","display_name":"Oded Kariv","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oded Kariv","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001013961"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.7103,"has_fulltext":false,"cited_by_count":156,"citation_normalized_percentile":{"value":0.9382716,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"11","issue":"1","first_page":"117","last_page":"129"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9940000176429749,"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/T11797","display_name":"graph theory and CDMA systems","score":0.98580002784729,"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/combinatorics","display_name":"Combinatorics","score":0.8620685338973999},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.8207422494888306},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8158583641052246},{"id":"https://openalex.org/keywords/multigraph","display_name":"Multigraph","score":0.6755852699279785},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6031714677810669},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.5507737398147583},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5412994623184204},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5252601504325867},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.5190516114234924},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5150144100189209},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.5094850659370422},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.47491228580474854},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35035407543182373},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2735177278518677},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.23673412203788757}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8620685338973999},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.8207422494888306},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8158583641052246},{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.6755852699279785},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6031714677810669},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.5507737398147583},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5412994623184204},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5252601504325867},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.5190516114234924},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5150144100189209},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.5094850659370422},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.47491228580474854},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35035407543182373},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2735177278518677},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.23673412203788757}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0211009","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211009","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1587889267","https://openalex.org/W1965437596","https://openalex.org/W1968297724","https://openalex.org/W2003160050","https://openalex.org/W2007635679","https://openalex.org/W2016715486","https://openalex.org/W2089828587","https://openalex.org/W2093229192","https://openalex.org/W2125690626","https://openalex.org/W2157529519","https://openalex.org/W2401610261","https://openalex.org/W2577446513"],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W4297911588","https://openalex.org/W4291316360","https://openalex.org/W2046652778","https://openalex.org/W4294957130","https://openalex.org/W2585997002","https://openalex.org/W1546043504","https://openalex.org/W151506147","https://openalex.org/W2793500002","https://openalex.org/W2029287218"],"abstract_inverted_index":{"A":[0],"minimum":[1],"edge":[2],"coloring":[3,62,84],"of":[4,11,53,59],"a":[5,9],"bipartite":[6,74],"graph":[7],"is":[8,21,89],"partition":[10],"the":[12,22,26,50,77],"edges":[13],"into":[14],"$\\Delta":[15,19,54],"$":[16,20,55],"matchings,":[17],"where":[18],"maximum":[23,69],"degree":[24],"in":[25,32,76],"graph.":[27],"Coloring":[28],"algorithms":[29,43,63],"that":[30],"run":[31],"time":[33,79],"$O(\\min":[34],"(m(\\log":[35],"n)^2":[36],",n^2":[37],"\\log":[38],"n))$":[39],"are":[40],"presented.":[41,91],"The":[42,61],"rely":[44],"on":[45,72],"an":[46,56],"efficient":[47],"procedure":[48],"for":[49,83],"special":[51],"case":[52],"exact":[57],"power":[58],"two.":[60],"can":[64],"be":[65],"used":[66],"to":[67],"find":[68],"cardinality":[70],"matchings":[71],"regular":[73],"graphs":[75],"above":[78],"bound.":[80],"An":[81],"algorithm":[82],"multigraphs":[85],"with":[86],"large":[87],"multiplicities":[88],"also":[90]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}