{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:24:35Z","timestamp":1743103475600,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642206610"},{"type":"electronic","value":"9783642206627"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20662-7_25","type":"book-chapter","created":{"date-parts":[[2011,4,20]],"date-time":"2011-04-20T06:05:25Z","timestamp":1303279525000},"page":"292-303","source":"Crossref","is-referenced-by-count":0,"title":["Speed Dating"],"prefix":"10.1007","author":[{"given":"Bastian","family":"Katz","sequence":"first","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]},{"given":"Ben","family":"Strasser","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Batagelj, V., Brandes, U.: Efficient generation of large random networks. Physical Review E\u00a0036113 (2005)","DOI":"10.1103\/PhysRevE.71.036113"},{"issue":"3","key":"25_CR2","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/0211043","volume":"11","author":"R. Cole","year":"1982","unstructured":"Cole, R., Hopcroft, J.: On edge coloring bipartite graphs. SIAM J. Comput.\u00a011(3), 540\u2013546 (1982)","journal-title":"SIAM J. Comput."},{"key":"25_CR3","first-page":"448","volume-title":"Proc. 15th Annu. ACM Sympos. Theor. Comput.(STOC 1983)","author":"H.N. Gabow","year":"1983","unstructured":"Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: Proc. 15th Annu. ACM Sympos. Theor. Comput(STOC 1983), pp. 448\u2013456. ACM, New York (1983)"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A. Goldberg","year":"1988","unstructured":"Goldberg, A., Tarjan, R.E.: A new approach to the maximum flow problem. J. Assoc. Comput. Mach.\u00a035, 921\u2013940 (1988)","journal-title":"J. Assoc. Comput. Mach."},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/76359.76368","volume":"36","author":"A. Goldberg","year":"1989","unstructured":"Goldberg, A., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. J. Assoc. Comput. Mach.\u00a036, 873\u2013886 (1989)","journal-title":"J. Assoc. Comput. Mach."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Misra, J., Gries, D.: A constructive proof of Vizing\u2019s Theorem. In: Inf. Proc. Let., pp. 131\u2013133 (1992)","DOI":"10.1016\/0020-0190(92)90041-S"},{"key":"25_CR7","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz, pp. 25\u201330 (1964) (in Russian)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20662-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:24:47Z","timestamp":1558571087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20662-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642206610","9783642206627"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20662-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}