{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:54:19Z","timestamp":1752461659624},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1007\/bf01955041","type":"journal-article","created":{"date-parts":[[2005,7,31]],"date-time":"2005-07-31T22:43:50Z","timestamp":1122849830000},"page":"397-412","source":"Crossref","is-referenced-by-count":54,"title":["Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring"],"prefix":"10.1007","volume":"15","author":[{"given":"E.","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jue","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01955041_CR1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02257777","volume":"46","author":"L. Babel","year":"1991","unstructured":"L. Babel, Finding maximum cliques in arbitrary and special graphs,Computing, 46:321\u2013341, 1991.","journal-title":"Computing"},{"key":"BF01955041_CR2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01415983","volume":"34","author":"L. Babel","year":"1990","unstructured":"L. Babel and G. Tinhofer, A branch and bound algorithm for the maximum clique problem,ZOR-Methods and Models of Operations Research, 34:207\u2013217, 1990.","journal-title":"ZOR-Methods and Models of Operations Research"},{"key":"BF01955041_CR3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0166-218X(86)90036-3","volume":"15","author":"E. Balas","year":"1986","unstructured":"E. Balas, A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring,Discrete Applied Mathematics, 15:123\u2013134, 1986.","journal-title":"Discrete Applied Mathematics"},{"key":"BF01955041_CR4","volume-title":"Fast Maximum Clique Algorithms, TB 17.4","author":"E. Balas","year":"1990","unstructured":"E. Balas and J. Xue, Fast Maximum Clique Algorithms, TB 17.4, TIMS\/ORSA, Las Vegas, May 7\u20139, 1990."},{"key":"BF01955041_CR5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1137\/0220012","volume":"20","author":"E. Balas","year":"1991","unstructured":"E. Balas and J. Xue, Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs,SIAM Journal of Computing, 20:209\u2013221, 1991. Addendum,SIAM Journal on Computing, 21:1000, 1992.","journal-title":"SIAM Journal of Computing"},{"key":"BF01955041_CR6","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","volume":"14","author":"E. Balas","year":"1986","unstructured":"E. Balas and C. S. Yu, Finding a maximum clique in an arbitrary graph,SIAM Journal on Computing, 14:1054\u20131068, 1986.","journal-title":"SIAM Journal on Computing"},{"key":"BF01955041_CR7","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"B. Bollob\u00e1s,Random Graphs, Academic Press, New York, 1985."},{"key":"BF01955041_CR8","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Brelaz","year":"1979","unstructured":"D. Brelaz, New methods to color the vertices of a graph,Communications of the ACM, 22:251\u2013256, 1979.","journal-title":"Communications of the ACM"},{"key":"BF01955041_CR9","unstructured":"R. Carraghan and P. M. Pardalos, A Parallel Algorithm for the Maximum Weight Clique Problem, Technical Report CS-90-40, Department of Computer Science, Pennsylvania State University, 1990."},{"key":"BF01955041_CR10","first-page":"456","volume":"19","author":"F. D. J. Dunstan","year":"1975","unstructured":"F. D. J. Dunstan, Sequential Colorings of Graphs,Proceedings of the 5th British Combinatorial Conference, Vol. 19, 1975, pp. 456\u2013463.","journal-title":"Proceedings of the 5th British Combinatorial Conference"},{"key":"BF01955041_CR11","first-page":"325","volume":"21","author":"M. Gr\u00f6tschel","year":"1989","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver, Polynomial algorithms for perfect graphs,Annals of Discrete Mathematics, 21:325\u2013356, 1989.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF01955041_CR12","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"F. T. Leighton","year":"1979","unstructured":"F. T. Leighton, A graph coloring algorithm for large scheduling problems,Journal of Research of the National Bureau of Standards, 84:489\u2013506, 1979.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"BF01955041_CR13","unstructured":"C. Mannino and A. Sassano, An Exact Algorithm for the Stable Set Problem, IASI-CNR Report No. 334, Rome, 1992."},{"key":"BF01955041_CR14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/B978-1-4832-3187-7.50015-5","volume-title":"Graph Theory and Computing","author":"D. W. Matula","year":"1972","unstructured":"D. W. Matula, G. Marble, and J. D. Isaacson, Graph coloring algorithms, in R. C. Read (ed.),Graph Theory and Computing, Academic Press, London, 1972, pp. 109\u2013122."},{"key":"BF01955041_CR15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"D. J. A. Welsh","year":"1967","unstructured":"D. J. A. Welsh and M. B. Powell, An upper bound for the chromatic number of a graph and its application to timetabling problems,The Computer Journal, 10:85\u201386, 1967.","journal-title":"The Computer Journal"},{"key":"BF01955041_CR16","unstructured":"J. Xue, Fractional Coloring Heuristic with Application to the Maximum Clique Problem, ARIDAM V, Abstracts, RUTCOR Report No.2-90, May\u2013June 1990, p. 67."},{"key":"BF01955041_CR17","volume-title":"Ph.D. thesis","author":"J. Xue","year":"1991","unstructured":"J. Xue, Fast algorithms for vertex packing and related problems, Ph.D. thesis, GSIA, Carnegie Mellon University, Pittsburgh, PA, 1991."},{"key":"BF01955041_CR18","doi-asserted-by":"crossref","unstructured":"J. Xue, Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem,Networks, to appear.","DOI":"10.1002\/net.3230240208"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01955041.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01955041\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01955041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T17:20:53Z","timestamp":1557768053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01955041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["BF01955041"],"URL":"https:\/\/doi.org\/10.1007\/bf01955041","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}