{"id":"https://openalex.org/W1968876216","doi":"https://doi.org/10.1137/0221058","title":"Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs","display_name":"Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs","alternate_titles":[],"publication_year":1992,"publication_date":"1992-10-01","ids":{"openalex":"https://openalex.org/W1968876216","doi":"https://doi.org/10.1137/0221058","mag":"1968876216"},"language":"en","primary_location":{"id":"doi:10.1137/0221058","doi":"https://doi.org/10.1137/0221058","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0221058","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,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"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"},"parent_works":[],"lineage":["https://openalex.org/W1968876216"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5072070820","display_name":"Egon Balas","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Egon Balas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5110868828","display_name":"Jue Xue","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Jue Xue","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4529,"has_fulltext":false,"cited_by_count":56,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.88069835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":96},"biblio":{"volume":"21","issue":"5","first_page":"1000","last_page":"1000"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6650000214576721,"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.6650000214576721,"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.33149999380111694,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/chordal-graphs","display_name":"chordal graphs","score":0.9959999918937683},{"id":"https://openalex.org/keywords/maximum-clique-problem","display_name":"maximum clique problem","score":0.8180000185966492},{"id":"https://openalex.org/keywords/clique-finding","display_name":"clique finding","score":0.6060000061988831},{"id":"https://openalex.org/keywords/fast-algorithms","display_name":"fast algorithms","score":0.5260000228881836},{"id":"https://openalex.org/keywords/independent-sets","display_name":"independent sets","score":0.5580000281333923},{"id":"https://openalex.org/keywords/vertex-cover-problem","display_name":"vertex cover","score":0.9750000238418579}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7903522849082947},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6791186332702637},{"id":"https://openalex.org/C2778945725","wikidata":"https://www.wikidata.org/wiki/Q352858","display_name":"Addendum","level":2,"score":0.582403838634491},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5279955863952637},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.45098671317100525},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4280293583869934},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3401353657245636},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32500001788139343},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.06638482213020325},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0221058","doi":"https://doi.org/10.1137/0221058","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0221058","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,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"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":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W14774902","https://openalex.org/W2030774898","https://openalex.org/W4253314095"],"related_works":["https://openalex.org/W4253314095","https://openalex.org/W1578553898","https://openalex.org/W2065769612","https://openalex.org/W2030774898","https://openalex.org/W6995587831","https://openalex.org/W14774902","https://openalex.org/W4230526896","https://openalex.org/W9324657","https://openalex.org/W4235703024","https://openalex.org/W145615405"],"abstract_inverted_index":{"Previous":[0,147],"article":[1,148],"Addendum:":[2],"Minimum":[3,36,68],"Weighted":[4,37],"Coloring":[5,38],"of":[6,39,71,137],"Triangulated":[7,40],"Graphs,":[8,41],"with":[9,42,74,108],"Application":[10,43],"to":[11,31,44,76],"Maximum":[12,45],"Weight":[13,46],"Vertex":[14,47,130,155],"Packing":[15,48,131],"and":[16,23,27,49,64,81,132,154,164,200,216],"Clique":[17,50],"Finding":[18,51],"in":[19,52,84],"Arbitrary":[20,53],"GraphsEgon":[21],"Balas":[22,26,63],"Jue":[24,28,66],"XueEgon":[25],"Xuehttps://doi.org/10.1137/0221058PDFBibTexSections":[29],"ToolsAdd":[30],"favoritesExport":[32],"CitationTrack":[33],"CitationsEmail":[34],"SectionsAbout\"Addendum:":[35],"Graphs.\"":[54],"SIAM":[55,87],"Journal":[56,182],"on":[57,183],"Computing,":[58],"21(5),":[59],"p.":[60],"1000[1]":[61],"Egon":[62,98],",":[65],"Xue,":[67,124],"weighted":[69],"coloring":[70],"triangulated":[72,162],"graphs,":[73,86],"application":[75],"maximum":[77,168],"weight":[78],"vertex":[79],"packing":[80],"clique":[82,169],"finding":[83,104],"arbitrary":[85],"J.":[88,123],"Comput.,":[89],"20":[90],"(1991),":[91],"209\u2013221":[92],"10.1137/0220012":[93],"92h:68069":[94],"0722.68086":[95],"LinkISIGoogle":[96],"Scholar[2]":[97],"Balas,":[99],"A":[100],"fast":[101],"algorithm":[102],"for":[103,129,166,198,214],"an":[105],"edge-maximal":[106],"subgraph":[107],"a":[109],"TR-formative":[110],"coloring,":[111],"Discrete":[112],"Appl.":[113],"Math.,":[114],"15":[115],"(1986),":[116],"123\u2013134":[117],"10.1016/0166-218X(86)90036-3":[118],"88e:05037":[119],"0633.05039":[120],"CrossrefISIGoogle":[121],"Scholar[3]":[122],"Ph.D.":[125],"Thesis,":[126],"Fast":[127],"Algorithms":[128],"Related":[133],"Problems,":[134],"Graduate":[135],"School":[136],"Industrial":[138,199,215],"Administration,":[139],"Carnegie-Mellon":[140],"University,":[141],"Pittsburgh,":[142],"PA,":[143],"1991":[144],"Google":[145],"Scholar":[146],"FiguresRelatedReferencesCited":[149],"byDetails":[150],"Clique,":[151],"Independent":[152],"Set,":[153],"Cover12":[156],"October":[157],"2021":[158],"Cross":[159,175],"Ref":[160,176],"Edge-maximal":[161],"subgraphs":[163],"heuristics":[165],"the":[167],"problemNetworks,":[170],"Vol.":[171],"24,":[172],"No.":[173],"2":[174],"Volume":[177],"21,":[178],"Issue":[179],"5|":[180],"1992SIAM":[181],"Computing":[184],"History":[185],"Submitted:28":[186],"July":[187,189,192],"1992Accepted:28":[188],"1992Published":[190],"online:13":[191],"2006":[193],"InformationCopyright":[194],"\u00a9":[195],"1992":[196],"Society":[197],"Applied":[201,217],"MathematicsPDF":[202],"Download":[203],"Article":[204],"&":[205],"Publication":[206],"DataArticle":[207],"DOI:10.1137/0221058Article":[208],"page":[209],"range:pp.":[210],"1000-1000ISSN":[211],"(print):0097-5397ISSN":[212],"(online):1095-7111Publisher:Society":[213],"Mathematics":[218]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1968876216","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
