Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs

Abstract

Previous article Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary GraphsEgon Balas and Jue XueEgon Balas and Jue Xuehttps://doi.org/10.1137/0221058PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout"Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs." SIAM Journal on Computing, 21(5), p. 1000[1] Egon Balas and , Jue Xue, Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs, SIAM J. Comput., 20 (1991), 209–221 10.1137/0220012 92h:68069 0722.68086 LinkISIGoogle Scholar[2] Egon Balas, A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring, Discrete Appl. Math., 15 (1986), 123–134 10.1016/0166-218X(86)90036-3 88e:05037 0633.05039 CrossrefISIGoogle Scholar[3] J. Xue, Ph.D. Thesis, Fast Algorithms for Vertex Packing and Related Problems, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1991 Google Scholar Previous article FiguresRelatedReferencesCited byDetails Clique, Independent Set, and Vertex Cover12 October 2021 Cross Ref Edge-maximal triangulated subgraphs and heuristics for the maximum clique problemNetworks, Vol. 24, No. 2 Cross Ref Volume 21, Issue 5| 1992SIAM Journal on Computing History Submitted:28 July 1992Accepted:28 July 1992Published online:13 July 2006 InformationCopyright © 1992 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0221058Article page range:pp. 1000-1000ISSN (print):0097-5397ISSN (online):1095-7111Publisher:Society for Industrial and Applied Mathematics