{"id":"https://openalex.org/W4253314095","doi":"https://doi.org/10.1137/0220012","title":"Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs","display_name":"Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs","publication_year":1991,"publication_date":"1991-04-01","ids":{"openalex":"https://openalex.org/W4253314095","doi":"https://doi.org/10.1137/0220012"},"language":"en","primary_location":{"id":"doi:10.1137/0220012","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220012","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/A5072070820","display_name":"Egon Balas","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Egon Balas","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5110868828","display_name":"Jue Xue","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jue Xue","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072070820"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.6183,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.96140218,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"20","issue":"2","first_page":"209","last_page":"221"},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.996399998664856,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.8145474195480347},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7079434394836426},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6101647019386292},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.48312804102897644},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4639648199081421},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.462862104177475},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.45843014121055603},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.4473890960216522},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4412887692451477},{"id":"https://openalex.org/keywords/perfect-graph","display_name":"Perfect graph","score":0.42956095933914185},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3993934094905853},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2827003002166748},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16081517934799194},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.06732937693595886}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8145474195480347},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7079434394836426},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6101647019386292},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.48312804102897644},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4639648199081421},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.462862104177475},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.45843014121055603},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.4473890960216522},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4412887692451477},{"id":"https://openalex.org/C32972407","wikidata":"https://www.wikidata.org/wiki/Q1187620","display_name":"Perfect graph","level":5,"score":0.42956095933914185},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3993934094905853},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2827003002166748},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16081517934799194},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.06732937693595886},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0220012","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220012","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":7,"referenced_works":["https://openalex.org/W1973310391","https://openalex.org/W2013415302","https://openalex.org/W2043005464","https://openalex.org/W2048053250","https://openalex.org/W2058408846","https://openalex.org/W2086119402","https://openalex.org/W2320198223"],"related_works":["https://openalex.org/W2789636091","https://openalex.org/W2282273380","https://openalex.org/W2043005464","https://openalex.org/W2109391260","https://openalex.org/W199404365","https://openalex.org/W2033003769","https://openalex.org/W2595228924","https://openalex.org/W2929047994","https://openalex.org/W1991410678","https://openalex.org/W4248695691"],"abstract_inverted_index":{"Efficient":[0],"algorithms":[1],"are":[2],"known":[3],"for":[4,36,54,109],"finding":[5,37,68],"a":[6,11,17,22,38,45,76,88,106],"maximum":[7,18,111],"weight":[8,19,112],"stable":[9],"set,":[10],"minimum":[12,39],"weighted":[13,40],"clique":[14,20,113],"covering,":[15],"and":[16],"of":[21,43,67,105],"vertex-weighted":[23],"triangulated":[24,90],"graph.":[25,46,118],"However,":[26],"there":[27],"is":[28,121],"no":[29],"comparably":[30],"efficient":[31],"algorithm":[32,100],"in":[33,69,84,115],"the":[34,55,62,65,102,110],"literature":[35],"vertex":[41],"coloring":[42],"such":[44],"This":[47],"paper":[48],"gives":[49],"an":[50,70,116],"$O(|V|^2":[51],")$":[52],"procedure":[53,63,108],"problem":[56,66,114],"(Algorithm":[57,93],"1).":[58],"It":[59],"then":[60],"extends":[61],"to":[64,87,129],"arbitrary":[71,117,124],"graph":[72],"$G":[73],"=":[74],"(V,E)$":[75],"maximal":[77,89],"induced":[78],"subgraph":[79,91],"$G(W)$":[80],"color-equivalent":[81],"(as":[82],"defined":[83],"\u00a7":[85],"3)":[86],"$G(T)$":[92],"2).":[94],"Finally,":[95],"it":[96],"uses":[97],"this":[98],"latter":[99],"as":[101],"main":[103],"ingredient":[104],"branch-and-bound":[107],"Computational":[119],"experience":[120],"presented":[122],"on":[123],"random":[125],"graphs":[126],"with":[127],"up":[128],"2,000":[130],"vertices.":[131]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"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":2},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-23T09:07:50.710637","created_date":"2025-10-10T00:00:00"}