{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T05:27:41Z","timestamp":1746077261259},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642028816"},{"type":"electronic","value":"9783642028823"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02882-3_13","type":"book-chapter","created":{"date-parts":[[2009,7,10]],"date-time":"2009-07-10T10:49:21Z","timestamp":1247222961000},"page":"116-126","source":"Crossref","is-referenced-by-count":1,"title":["A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions"],"prefix":"10.1007","author":[{"given":"Akiyoshi","family":"Shioura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mutsunori","family":"Yagiura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1137\/060656413","volume":"37","author":"J. Correa","year":"2007","unstructured":"Correa, J., Goemans, M.X.: Improved bounds on nonblocking 3-stage Clos networks. SIAM J.\u00a037, 870\u2013894 (2007)","journal-title":"SIAM J."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1017\/S0963548300001127","volume":"3","author":"J.K. Dugdale","year":"1994","unstructured":"Dugdale, J.K., Hilton, A.J.W.: Amalgamated factorizations of complete graphs. Combin. Probab. Comput.\u00a03, 215\u2013231 (1994)","journal-title":"Combin. Probab. Comput."},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-540-87744-8_34","volume-title":"Algorithms - ESA 2008","author":"U. Feige","year":"2008","unstructured":"Feige, U., Singh, M.: Edge coloring and decompositions of weighted graphs. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol.\u00a05193, pp. 405\u2013416. Springer, Heidelberg (2008)"},{"key":"13_CR4","unstructured":"Hilton, A.J.W., de Werra, D.: Sufficient conditions for balanced and for equitable edge-colouring of graphs. O.R.\u00a0Working paper 82\/3, D\u00e9partement de Math\u00e9matiques, \u00c9cole Polytechnique F\u00e9d\u00e9rate de Lausanne, Switzerland (1982)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0012-365X(94)90112-0","volume":"128","author":"A.J.W. Hilton","year":"1994","unstructured":"Hilton, A.J.W., de Werra, D.: A sufficient condition for equitable edge-colourings of simple graphs. Discrete Math.\u00a0128, 179\u2013201 (1994)","journal-title":"Discrete Math."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1142\/S0129054193000079","volume":"4","author":"S. Nakano","year":"1993","unstructured":"Nakano, S., Nishizeki, T.: Scheduling file transfers under port and channel constraints. Internat. J. Found. Comput. Sci.\u00a04, 101\u2013115 (1993)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"13_CR7","unstructured":"Nakano, S., Suzuki, Y., Nishizeki, T.: An algorithm for the nearly equitable edge-coloring of graphs. IEICE Trans. Inf. & Syst.\u00a0J78-D-I, 437\u2013444 (1995) (in Japanese)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-540-72588-6_75","volume-title":"Computational Science \u2013 ICCS 2007","author":"H. Song","year":"2007","unstructured":"Song, H., Wu, J., Liu, G.: The equitable edge-coloring of series-parallel graphs. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol.\u00a04489, pp. 457\u2013460. Springer, Heidelberg (2007)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"de Werra, D.: Equitable colorations of graphs. Revue fran\u00e7aise d\u2019Informatique et de Recherche Operationelle R-3, pp. 3\u20138 (1971)","DOI":"10.1051\/m2an\/197105R300031"},{"key":"13_CR10","first-page":"1029","volume":"E87-A","author":"X. Xie","year":"2004","unstructured":"Xie, X., Ono, T., Nakano, S., Hirata, T.: An improved algorithm for the nearly equitable edge-coloring problem. IEICE Trans. Fund.\u00a0E87-A, 1029\u20131033 (2004)","journal-title":"IEICE Trans. Fund."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"383","DOI":"10.7155\/jgaa.00171","volume":"12","author":"X. Xie","year":"2008","unstructured":"Xie, X., Yagiura, M., Ono, T., Hirata, T., Zwick, U.: An efficient algorithm for the nearly equitable edge coloring problem. J. Graph Algorithms Appl.\u00a012, 383\u2013399 (2008)","journal-title":"J. Graph Algorithms Appl."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02882-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T10:44:44Z","timestamp":1558435484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02882-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028816","9783642028823"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02882-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}