{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:20:06Z","timestamp":1742617206296,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583257"},{"type":"electronic","value":"9783540486534"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58325-4_221","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:45:06Z","timestamp":1330271106000},"page":"541-549","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The totally-perfect bipartite graph and its construction"],"prefix":"10.1007","author":[{"given":"Kunihiro","family":"Fujiyoshi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoji","family":"Kajitani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Niitsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"63_CR1","doi-asserted-by":"crossref","unstructured":"S. D. Brown, R. J. Francis, J. Rose, and Z. G. Vranesic, \u201cField-Programmable Gate Arrays\u201d, Kluwer Academic Pub., 1992.","DOI":"10.1007\/978-1-4615-3572-0"},{"key":"63_CR2","unstructured":"\u201cThe Programmable Logic Data Book\u201d, XILINX, 1993."},{"issue":"No.45","key":"63_CR3","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/0020-0190(81)90050-8","volume":"13","author":"M. Blum","year":"1981","unstructured":"M. Blum, R. M. Karp, O. Vornberger, C. H. Papadimitriou, and M. Yannakakis, \u201cThe complexity of testing whether a graph is a superconcentrator\u201d, Information Processing Letters, Vol. 13, No. 4,5 (1981), p.p.164\u2013167","journal-title":"Information Processing Letters"},{"issue":"4","key":"63_CR4","first-page":"71","volume":"9","author":"G. A. Margulis","year":"1973","unstructured":"G. A. Margulis, \u201cExplicit constructions of concentrators\u201d, Problemy Peredachi Informatsii 9 (4) (1973) 71\u201380. (English translation in: Problems of Information Transmission (Plenum, New York, 1975.))","journal-title":"Problemy Peredachi Informatsii"},{"key":"63_CR5","doi-asserted-by":"crossref","unstructured":"K. Fujiyoshi, Y. Kajitani, and H. Niitsu, \u201cDesign of optimum totally-perfect connection-block of FPGA\u201d, IEEE International Symposium on Circuits and Systems 1994, pp. 221\u2013225.","DOI":"10.1109\/ISCAS.1994.408795"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58325-4_221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:25:18Z","timestamp":1742595918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58325-4_221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583257","9783540486534"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-58325-4_221","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}