{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T14:03:49Z","timestamp":1582034629223},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1145\/210332.210337","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:25:57Z","timestamp":1027769157000},"page":"844-856","source":"Crossref","is-referenced-by-count":462,"title":["Color-coding"],"prefix":"10.1145","volume":"42","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[{"name":"Institute for Advanced Study, Princeton, NJ; and Tel-Aviv Univ., Tel-Aviv, Israel"}]},{"given":"Raphael","family":"Yuster","sequence":"additional","affiliation":[{"name":"Tel-Aviv Univ., Tel-Aviv, Israel"}]},{"given":"Uri","family":"Zwick","sequence":"additional","affiliation":[{"name":"Tel-Aviv Univ., Tel-Aviv, Israel"}]}],"member":"320","reference":[{"key":"e_1_2_1_1_1","unstructured":"~ALON N. BRUCK J. NAOR J. NAOR M. AND ROTH R.M. 1992. Construction of asymptoti- ~cally good low-rate error-correcting codes through pseudo-random graphs. 1EEE Trcms. hzf. ~Theory 38 2 509-516. ~ALON N. BRUCK J. NAOR J. NAOR M. AND ROTH R.M. 1992. Construction of asymptoti- ~cally good low-rate error-correcting codes through pseudo-random graphs. 1EEE Trcms. hzf. ~Theory 38 2 509-516."},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/rsa.3240030308","article-title":"\/1993. Simple constructions of ~almost k-wise independent random variab}{es","volume":"3","author":"~ALON N.","year":"1992","journal-title":"Random Struct. Algorifhms"},{"key":"e_1_2_1_3_1","unstructured":"~ALON N. AND NAOR M. Dcrandomlzation witnesses for boolean matrix multiphcation and ~construction of perfect has functions. Algo~ith zica to appear. ~ALON N. AND NAOR M. Dcrandomlzation witnesses for boolean matrix multiphcation and ~construction of perfect has functions. Algo~ith zica to appear."},{"key":"e_1_2_1_4_1","unstructured":"~ALON N. YUSTER R. AND ZWICK U. Finding and counting given length cycles. SL4M J. Disc. ~Math. to appear. ~ALON N. YUSTER R. AND ZWICK U. Finding and counting given length cycles. SL4M J. Disc. ~Math. to appear."},{"key":"e_1_2_1_5_1","unstructured":"~BODLAENDER H.L. 1993. On linear time minor tests with depth-first search. J. Algorithm s 14 ~1-23. 10.1006\/jagm.1993.1001 ~BODLAENDER H.L. 1993. On linear time minor tests with depth-first search. J. Algorithm s 14 ~1-23. 10.1006\/jagm.1993.1001"},{"key":"e_1_2_1_6_1","unstructured":"~BOLLOB ~S. B. 1978. Extremal graph theoJy. Academic Press Orlando Fla. ~BOLLOB ~S. B. 1978. Extremal graph theoJy. Academic Press Orlando Fla."},{"key":"e_1_2_1_7_1","unstructured":"~BOLLOB ~S B. 1986. Extremal graph theol~ with e lpha slS ott probabilistic methods. Regional ~conference series in mathematics No. 62. American Mathematical Society Providence. R.I. ~BOLLOB ~S B. 1986. Extremal graph theol~ with e lpha slS ott probabilistic methods. Regional ~conference series in mathematics No. 62. American Mathematical Society Providence. R.I."},{"key":"e_1_2_1_8_1","unstructured":"~CHIBA IN. AND NISHIZEKI L. 198J. Art~oricity and subgraph listing algorithms. 57~3f Z. ~Comput. 14 210 223. 10.1137\/0214017 ~CHIBA IN. AND NISHIZEKI L. 198J. Art~oricity and subgraph listing algorithms. 57~3f Z. ~Comput. 14 210 223. 10.1137\/0214017"},{"key":"e_1_2_1_9_1","unstructured":"~CORMEN T. H. LEISERSON C. E. AND RIVEST R.L. 1992. hztroduction to Algorzth zs. The MIT ~Press Cambridge Mass. ~CORMEN T. H. LEISERSON C. E. AND RIVEST R.L. 1992. hztroduction to Algorzth zs. The MIT ~Press Cambridge Mass."},{"key":"e_1_2_1_10_1","unstructured":"Proceedings of ~the 7th Annual Sympo~tu t o~z S ztcture m Complexity Theory Boston Mass.). IEEE Los ~Alamltos Cahf. Proceedings of ~the 7th Annual Sympo~tu t o~z S ztcture m Complexity Theory R. G. ~DOWNEY M.R. FELLOWS FLxed-parameter lntractabihty 1992 36 49"},{"key":"e_1_2_1_11_1","unstructured":"D 1995. Subgraph isomorphism in planar graphs and related problems. In Proceed- ~lugs of tile 6th Annual ACM-SIAM ~'rnpostu l on dzscrete Algonthms San Francisco Calif.). ~ACM New York D 1995. Subgraph isomorphism in planar graphs and related problems. In Proceed- ~lugs of tile 6th Annual ACM-SIAM ~'rnpostu l on dzscrete Algonthms ~EPPSTEIN 632 640 10.5555\/313651.313830"},{"key":"e_1_2_1_12_1","DOI":"10.1145\/828.1884","doi-asserted-by":"publisher"},{"key":"e_1_2_1_13_1","unstructured":"ACM New York ACM M. ~FURER B. RAGHAVACHARI~ Approximating the minimum degree spanning tree ~to within one from the optimal degree. In Proceedzngs of the 3rdAnnualACM-SIAM Syrnposzum ~on Dzscrcte AlgorMmzs (Orlando Fla. Jan. 27-29) 1992 317 324 10.5555\/139404.139469"},{"key":"e_1_2_1_14_1","author":"~ITAI A","year":"1978","article-title":"Finding a minimum circuit in a graph","journal-title":"SlAM J. Comput. 7, ~413 423."},{"key":"e_1_2_1_15_1","DOI":"10.1016\/0196-6774(87)90043-5","doi-asserted-by":"publisher"},{"key":"e_1_2_1_16_1","author":"~KARGER D.","first-page":"421","series-title":"Lecture Notes in Computer Science, vol 709","volume-title":"Proceedings of the {}brkshop on Algorithms and Data St~ctures (Montreal, Que., ~Canada)"},{"key":"e_1_2_1_17_1","DOI":"10.1145\/2402.322385","doi-asserted-by":"publisher"},{"key":"e_1_2_1_18_1","first-page":"239","article-title":"How to find long paths efficiently","volume":"25","author":"~MONIEN B.","year":"1985","journal-title":"Ann. Disc. Math."},{"key":"e_1_2_1_19_1","unstructured":"Proceedings of tile 22rid Annual ACM Sympostum on TheoO' of Computing ~ Baltimore Md. May 14-16). ACM New York Proceedings of tile 22rid Annual ACM Sympostum on TheoO' of Computing ~ J. ~NAOR M. NAOR Small-bias probability spaces: Efficient constructions and ~applications 1990 213 10.1145\/100216.100244 10.1145\/100216.100244 10.1145\/100216.100244"},{"key":"e_1_2_1_20_1","first-page":"131","article-title":"The clique problem for planar graphs, blf ~Proc","volume":"13","author":"~P~ OU, C","year":"1981","journal-title":"Lett."},{"key":"e_1_2_1_21_1","unstructured":"Proceedings of the 8th Annual Sympo3tum on Structure m ~ComplexlO' Theory San Diego Calif.'). IEEE Los Alamitos Calif. Proceedings of the 8th Annual Sympo3tum on Structure m ~ComplexlO' Theory C. H. ~PAPADIMITRIOU Y4. KIS NNAIO U. On hmlted nondeterminism and the com- ~plex~ty of the V-C dimension 1993 12 18"},{"key":"e_1_2_1_22_1","author":"~PLEHN J.","first-page":"18","series-title":"Lecture Notes in Computer ~Science, vol 484","volume-title":"Proceedings of the ~1Oth Workshop on Graph Theoretzcal Cotzcepts m Computer Sczence"},{"key":"e_1_2_1_23_1","author":"~RICIIARDS D.","year":"1986","article-title":"Finding short cycles in a planar graph using separators","journal-title":"J. Algorzthms 7, ~382 394."},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors. II. Algorithmic aspects of tree-width ~J","volume":"7","author":"~ROBERTSON N.","year":"1986","journal-title":"Algorithms"},{"key":"e_1_2_1_25_1","DOI":"10.1016\/0095-8956(86)90030-4","doi-asserted-by":"publisher"},{"key":"e_1_2_1_26_1","unstructured":"~SCHMIDT J P. AND S1EOEL A. 1090. The spatial complexity of oblivious k-probe hash ~functions. SL4M J. Computing 19 5 775-786. 10.1137\/0219054 ~SCHMIDT J P. AND S1EOEL A. 1090. The spatial complexity of oblivious k-probe hash ~functions. SL4M J. Computing 19 5 775-786. 10.1137\/0219054"},{"key":"e_1_2_1_27_1","author":"~YUSTEP","first-page":"532","volume-title":"Proceedztzgs of the 21st ~hzternatlotzal Colloqutum ott Auto,zata, Languages' and Programming (Jerusalem, Israel). Lecture ~Notes in Computer Science"}],"container-title":["Journal of the ACM (JACM)"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=210337&ftid=26558&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,16]],"date-time":"2020-02-16T18:03:49Z","timestamp":1581876229000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":27,"journal-issue":{"published-print":{"date-parts":[[1995,7]]},"issue":"4"},"alternative-id":["10.1145\/210332.210337"],"URL":"http:\/\/dx.doi.org\/10.1145\/210332.210337","relation":{"cites":[]},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":["Control and Systems Engineering","Hardware and Architecture","Software","Artificial Intelligence","Information Systems"]}}