{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T22:40:22Z","timestamp":1737067222121,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540714309"},{"type":"electronic","value":"9783540714316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71431-6_28","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T21:06:50Z","timestamp":1180904810000},"page":"302-313","source":"Crossref","is-referenced-by-count":1,"title":["Reconfigurable Hardware Acceleration of Canonical Graph Labelling"],"prefix":"10.1007","author":[{"given":"David B.","family":"Thomas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wayne","family":"Luk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Stumpf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"28_CR1","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1093\/nar\/gkg340","volume":"31","author":"D. Bu","year":"2003","unstructured":"Bu, D., et al.: Topological structure analysis of the protein-protein interaction network in budding yeast. Nucleic Acids Research\u00a031(9), 2443\u20132450 (2003)","journal-title":"Nucleic Acids Research"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Huan, J., et al.: Accurate classification of protein structural families based on coherent subgraph analysis. In: Proc. Pacific Symposium on Biocomputing (PSB), pp. 411\u2013422 (2004)","DOI":"10.1142\/9789812704856_0039"},{"key":"28_CR3","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1109\/ICDM.2003.1250974","volume-title":"Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM)","author":"J. Huan","year":"2003","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraph in the presence of isomorphism. In: Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM), pp. 549\u2013552. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"28_CR4","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph dscovery. Technical Report TR-01-028, Department of Computer Science, University of Minnesota (2001)"},{"key":"28_CR5","unstructured":"Fortin, S.: The graph isomorphism problem. Technical Report TR-96-20, University of Alberta (1996)"},{"key":"28_CR6","unstructured":"McKay, B.: Practical graph isomorphism. In: Congressus Numerantium, pp. 45\u201387 (1981)"}],"container-title":["Lecture Notes in Computer Science","Reconfigurable Computing: Architectures, Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71431-6_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T22:04:57Z","timestamp":1737065097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71431-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540714309","9783540714316"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71431-6_28","relation":{},"subject":[]}}