{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T00:46:36Z","timestamp":1654994796400},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,6]]},"DOI":"10.1007\/s10878-005-1775-y","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T10:09:50Z","timestamp":1124532590000},"page":"331-347","source":"Crossref","is-referenced-by-count":6,"title":["A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs"],"prefix":"10.1007","volume":"9","author":[{"given":"Xueliang","family":"Li","sequence":"first","affiliation":[]},{"given":"Wenan","family":"Zang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1775_CR1","volume-title":"Topics on Perfect Graphs","year":"1984","unstructured":"C. Berge and V. Chv\u00e1tal (Eds.), Topics on Perfect Graphs. North-Holland, Amsterdam, 1984."},{"key":"1775_CR2","doi-asserted-by":"crossref","unstructured":"M. Chudnovsky, N. Robertson, P.D. Seymour, and R. Thomas, \u201cThe strong perfect graph theorem,\u201d Ann. of Math., to appear.","DOI":"10.4007\/annals.2006.164.51"},{"key":"1775_CR3","volume-title":"Linear Programming","author":"V. Chv\u00e1tal","year":"1983","unstructured":"V. Chv\u00e1tal, Linear Programming. W.H. Freeman and Company: New York, 1983."},{"key":"1775_CR4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01788536","volume":"3","author":"V. Chv\u00e1tal","year":"1987","unstructured":"V. Chv\u00e1tal and N. Sbihi, Bull-free Berge graphs are perfect. Graphs Combin, vol. 3, pp. 127\u2013139, 1987.","journal-title":"Graphs Combin"},{"key":"1775_CR5","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/0095-8956(88)90085-8","volume":"44","author":"V. Chv\u00e1tal","year":"1988","unstructured":"V. Chv\u00e1tal and N. Sbihi, \u201cRecognizing claw-free perfect graphs,\u201d J. Combin. Theory Ser. B, vol. 44, pp. 154\u2013176, 1988.","journal-title":"J. Combin. Theory Ser. B"},{"key":"1775_CR6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-60618-1_64","volume":"1017","author":"D.G. Degiorgi","year":"1995","unstructured":"D.G. Degiorgi and K. Simon, \u201cA dynamic algorithm for line graph recognition,\u201d Lecture Notes in Comput. Sci., vol. 1017, pp. 37\u201348, 1995.","journal-title":"Lecture Notes in Comput. Sci."},{"key":"1775_CR7","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford Jr.","year":"1956","unstructured":"L.R. Ford, Jr. and D.R. Fulkerson, \u201cMaximal flow through a network,\u201d Canad. J. Math., vol. 8, pp. 399\u2013404, 1956.","journal-title":"Canad. J. Math."},{"key":"1775_CR8","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability. W.H. Freeman and Company, New York, 1979."},{"key":"1775_CR9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0012-365X(85)80001-7","volume":"55","author":"F. Gavril","year":"1985","unstructured":"F. Gavril, \u201cAlgorithms on clique separable graphs,\u201d Discrete Math., vol. 55, pp. 245\u2013254, 1985.","journal-title":"Discrete Math."},{"key":"1775_CR10","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T. Gonzalez","year":"1976","unstructured":"T. Gonzalez and S. Sahni, \u201cOpen shop scheduling to minimize finish time,\u201d J. Assoc. Comput. Mach., vol. 23, pp. 665\u2013679, 1976.","journal-title":"J. Assoc. Comput. Mach"},{"key":"1775_CR11","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0304-0208(08)72943-8","volume-title":"Topics on Perfect Graphs","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver, \u201cPolynomial algorithms for perfect graphs,\u201d in Topics on Perfect Graphs C. Berge and V. Chv\u00e1tal (Eds.) North-Holland, Amsterdam, 1984, pp. 325\u2013356"},{"key":"1775_CR12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"J.E. Hopcroft and R.M. Karp, \u201cAn n5\/2 algorithm for maximum matchings in bipartite graphs,\u201d SIAM J. Comput., vol. 2, pp. 225\u2013231, 1973.","journal-title":"SIAM J. Comput"},{"key":"1775_CR13","first-page":"189","volume":"11","author":"W.L. Hsu","year":"1981","unstructured":"W.L. Hsu, \u201cHow to color claw-free perfect graphs,\u201d Ann. Discrete Math., vol. 11, pp. 189\u2013197, 1981.","journal-title":"Ann. Discrete Math"},{"key":"1775_CR14","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0304-0208(08)72944-X","volume-title":"Topics on Perfect Graphs","author":"W.L. Hsu","year":"1984","unstructured":"W.L. Hsu and G. Nemhauser, \u201cAlgorithms for maximum weight cliques, minimum weighted clique covers and minimum colorings of claw-free perfect graphs,\u201d in Topics on Perfect Graphs C. Berge and V. Chv\u00e1tal (Eds.) North-Holland, Amsterdam, 1984, pp. 357\u2013369."},{"key":"1775_CR15","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(81)90218-1","volume":"37","author":"W.L. Hsu","year":"1981","unstructured":"W.L. Hsu and G. Nemhauser, \u201cAlgorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs,\u201d Discrete Math., vol. 37, pp. 181\u2013191, 1981.","journal-title":"Discrete Math"},{"key":"1775_CR16","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0012-365X(82)90169-8","volume":"38","author":"W.L. Hsu","year":"1982","unstructured":"W.L. Hsu and G. Nemhauser, \u201cA polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs,\u201d Discrete Math., vol. 38, pp. 65\u201371, 1982.","journal-title":"Discrete Math."},{"key":"1775_CR17","first-page":"434","volume":"15","author":"A.V. Karzanov","year":"1974","unstructured":"A.V. Karzanov, \u201cDetermining the maximal flow in a network by the method of preflows,\u201d Soviet Math. Dokl., vol. 15, pp. 434\u2013437, 1974.","journal-title":"Soviet Math. Dokl."},{"key":"1775_CR18","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/321850.321853","volume":"21","author":"P.G.H. Lehot","year":"1974","unstructured":"P.G.H. Lehot, \u201cAn optimal algorithm to detect a line graph and output its root graph,\u201d J. Assoc. Comput. Mach., vol. 21, pp. 569\u2013575, 1974.","journal-title":"J. Assoc. Comput. Mach."},{"key":"1775_CR19","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L. Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz, Normal hypergraphs and the perfect graph conjecture,\u201d Discrete Math., vol. 2, pp. 253\u2013267, 1972.","journal-title":"Discrete Math."},{"key":"1775_CR20","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1006\/jctb.1998.1872","volume":"75","author":"F. Maffray","year":"1999","unstructured":"F. Maffray and B. Reed, A description of claw-free perfect graphs,\u201d J. Combin. Theory Ser. B, vol. 75, pp. 134\u2013156, 1999.","journal-title":"J. Combin. Theory Ser. B"},{"key":"1775_CR21","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/S0095-8956(76)80005-6","volume":"21","author":"K.R. Parthasarathy","year":"1976","unstructured":"K.R. Parthasarathy and G. Ravindra, \u201cThe strong perfect graph conjecture is true for K1,3-free graphs,\u201d J. Combin. Theory Ser. B, vol. 21, pp. 212\u2013223, 1976.","journal-title":"J. Combin. Theory Ser. B"},{"key":"1775_CR22","volume-title":"Perfect Graphs","year":"2001","unstructured":"J.L. Ramfrez-Alfons\u00edn and B.A. Reed (Eds.), Perfect Graphs. John Wiley & Sons, Ltd., Chichester, 2001."},{"key":"1775_CR23","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0020-0190(73)90029-X","volume":"2","author":"N.D. Roussopoulos","year":"1973","unstructured":"N.D. Roussopoulos, \u201cA m, n algorithm for determining the graph H from its line graph G,\u201d Inform. Process. Lett., vol. 2, pp. 108\u2013112, 1973.","journal-title":"Inform. Process. Lett."},{"key":"1775_CR24","unstructured":"A. Schrijver, Theory of Linear and Integer Programming. John Wiley & Sons, 1986."},{"key":"1775_CR25","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"R.E. Tarjan","year":"1985","unstructured":"R.E. Tarjan, \u201cDecomposition by clique separators,\u201d Discrete Math., vol. 55, pp. 221\u2013232, 1985.","journal-title":"Discrete Math"},{"key":"1775_CR26","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R.E. Tarjan","year":"1983","unstructured":"R.E. Tarjan, Data Structures and Network Algorithms, SIAM, Philadelphia, 1983."},{"key":"1775_CR27","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(81)90072-7","volume":"12","author":"S.H. Whitesides","year":"1981","unstructured":"S.H. Whitesides, \u201cAn algorithm for finding clique cut-sets,\u201d Inform. Process. Lett., vol. 12, pp. 31\u201332, 1981.","journal-title":"Inform. Process. Lett."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-1775-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-1775-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-1775-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:08Z","timestamp":1559276288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-1775-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["1775"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-1775-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}