{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:52:47Z","timestamp":1743018767208,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":19,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_76","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:36:50Z","timestamp":1214505410000},"page":"158-160","source":"Crossref","is-referenced-by-count":4,"title":["Color Coding"],"prefix":"10.1007","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"Raphael","family":"Yuster","sequence":"additional","affiliation":[]},{"given":"Uri","family":"Zwick","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"76_CR1_76","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"Alon, N., Goldreich, O., H\u00e5stad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. Random Struct. Algorithms 3(3), 289\u2013304 (1992)","journal-title":"Random Struct. Algorithms"},{"key":"76_CR2_76","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color coding. J.\u00a0ACM 42, 844\u2013856 (1995)","journal-title":"J. ACM"},{"issue":"3","key":"76_CR3_76","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N. Alon","year":"1997","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17(3), 209\u2013223 (1997)","journal-title":"Algorithmica"},{"issue":"6","key":"76_CR4_76","doi-asserted-by":"publisher","first-page":"1395","DOI":"10.1137\/S0097539702416761","volume":"32","author":"A. Bj\u00f6rklund","year":"2003","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Finding a\u00a0path of superlogarithmic length. SIAM J.\u00a0Comput. 32(6), 1395\u20131402 (2003)","journal-title":"SIAM J. Comput."},{"key":"76_CR5_76","unstructured":"Chen, J., Lu, S., Sze, S., Zhang, F.: Improved algorithms for path, matching, and packing problems. Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0298\u2013307 (2007)"},{"issue":"3","key":"76_CR6_76","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00014","volume":"3","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. J.\u00a0Graph Algorithms Appl. 3(3), 1\u201327 (1999)","journal-title":"J. Graph Algorithms Appl."},{"key":"76_CR7_76","doi-asserted-by":"crossref","unstructured":"Fellows, M.R.: New Directions and new challenges in algorithm design and complexity, parameterized. In: Lecture Notes in Computer Science, vol.\u00a02748, p.\u00a0505\u2013519 (2003)","DOI":"10.1007\/978-3-540-45078-8_44"},{"issue":"4","key":"76_CR8_76","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1137\/S0097539703427203","volume":"33","author":"J. Flum","year":"2004","unstructured":"Flum, J., Grohe, M.: The Parameterized complexity of counting problems. SIAM J.\u00a0Comput. 33(4), 892\u2013922 (2004)","journal-title":"SIAM J. Comput."},{"key":"76_CR9_76","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M.L. Fredman J.Koml\u00f3s","year":"1984","unstructured":"Fredman, M.L., J.Koml\u00f3s, Szemer\u00e9di, E.: Storing a\u00a0sparse table with O(1) worst case access time. J.\u00a0ACM 31, 538\u2013544 (1984)","journal-title":"J. ACM"},{"key":"76_CR10_76","doi-asserted-by":"crossref","unstructured":"H\u00fcffner, F., Wernicke, S., Zichner, T.: Algorithm engineering for Color Coding to facilitate Signaling Pathway Detection. In: Proceedings of the 5th Asia-Pacific Bioinformatics Conference (APBC), pp.\u00a0277\u2013286 (2007)","DOI":"10.1142\/9781860947995_0030"},{"key":"76_CR11_76","first-page":"239","volume":"25","author":"B. Monien","year":"1985","unstructured":"Monien, B.: How to find long paths efficiently. Ann. Discret. Math. 25, 239\u2013254 (1985)","journal-title":"Ann. Discret. Math."},{"issue":"4","key":"76_CR12_76","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J. Naor","year":"1993","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: efficient constructions and applications. SIAM J.\u00a0Comput. Comput. 22(4), 838\u2013856 (1993)","journal-title":"SIAM J. Comput. Comput."},{"issue":"2","key":"76_CR13_76","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1006\/jcss.1996.0058","volume":"53","author":"C.H. Papadimitriou","year":"1996","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On limited nondeterminism and the complexity of the V-C dimension. J.\u00a0Comput. Syst. Sci. 53(2), 161\u2013170 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"76_CR14_76","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-53832-1_28","volume":"484","author":"J. Plehn","year":"1990","unstructured":"Plehn, J., Voigt, B.: Finding minimally weighted subgraphs. Lect. Notes Comput. Sci. 484, 18\u201329 (1990)","journal-title":"Lect. Notes Comput. Sci."},{"key":"76_CR15_76","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.: Graph minors. II. Algorithmic aspects of tree-width. J.\u00a0Algorithms 7, 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"issue":"5","key":"76_CR16_76","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1137\/0219054","volume":"19","author":"J.P. Schmidt","year":"1990","unstructured":"Schmidt, J.P., Siegel, A.: The spatial complexity of oblivious k\u2011probe hash functions. SIAM J.\u00a0Comput. 19(5), 775\u2013786 (1990)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"76_CR17_76","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1089\/cmb.2006.13.133","volume":"13","author":"J. Scott","year":"2006","unstructured":"Scott, J., Ideker, T., Karp, R.M., Sharan, R.: Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks. J.\u00a0Comput. Biol. 13(2), 133\u2013144 (2006)","journal-title":"J. Comput. Biol."},{"key":"76_CR18_76","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1038\/nbt1196","volume":"24","author":"R. Sharan","year":"2006","unstructured":"Sharan, R., Ideker, T.: Modeling cellular machinery through biological network comparison. Nat. Biotechnol. 24, 427\u2013433 (2006)","journal-title":"Nat. Biotechnol."},{"key":"76_CR19_76","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1186\/1471-2105-7-199","volume":"7","author":"T. Shlomi","year":"2006","unstructured":"Shlomi, T., Segal, D., Ruppin, E., Sharan, R.: QPath: a\u00a0method for querying pathways in a\u00a0protein-protein interaction network. BMC Bioinform. 7, 199 (2006)","journal-title":"BMC Bioinform."}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T02:07:24Z","timestamp":1662170844000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_76"}},"subtitle":["1995; Alon, Yuster, Zwick"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_76","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}