Color-Coding

Journal of the ACM (JACM)

Volumn 42, Issue 4, 1995, Pages 844-856

  Alon, Noga ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Derandornization; perfect hashing; subgraph isomorphism; tree width

Indexed keywords

EID: 84976775257     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/210332.210337     Document Type: Article

References (26)

1. Alon N., Bruck, J., Naor, J., Naor, M. Roth, R. M. 1992. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Trans, Inf. Theory 38, 2, 509–516,
2. Alon, N., Goldreich, O., Hastad, J., and Peralta, R. 1992/1993. Simple constructions of almost k˜wise independent random variables. Random Struct. Algorithms 3, 3, (1992 ), 289 – 304. (Addendum in Random Struct. Algorithms, 4, 1, (1993), 119–120). 1992
3. Alon, N., and N.Naor, M. Dcrandomization, witnesses for boolean matrix multiplication and construction of perfect has functions. Algorithmic to appear.
4. Alon, N., Yuster, R. Zwick, U. Finding and counting given length cycles. SIAM J. Disc. Math, to agpear.
5. Bodlaender, B.H. L. 1993. On linear time minor tests with depth-first search. J. Algorithms, 14. 1–23.
6. bollobas. B. 1978. Extremal graph theory. Academic Press, Orlando, Fla.bollobas
7. Bollobas, B. 1986. Extremal graph theoiy with emphasis on probabilistic methods. Regional conference series in mathematics, No. 62. American Mathematical Society, Providence. R.I.
8. Chiba, cn., and Nishizeki, l. 1985. Arboricity and subgraph listing algorithms. SIAM T. Comput. 14, 210–223. chiba, n., and nishizeki, l.
9. Cormen, C.T. H., Leiserson, C. E., and Rivest, R. L. 1992. Introduction to Algorithms. The MIT Press, Cambridge, Mass. downey R. G. and fellows, M. R. 1992. Fixed-parameter intractability. In Proceedings of the 7th Annual Symposium on Structure in Complexity Theory (Boston, Mass.). IEEE, Los Alamitos, Calif., pp. 36–49.
10. Eppstein, D 1995. Subgraph isomorphism in planar graphs and related problems.Proceedings of the 6th Annual Symposium on discrete Algorithms (San Francisco, Calif.). ACM, New York, pp. 632–640.
11. Fredman, F.M. L., komlos, 1, and szemeredi, E. 1984. Storing a sparse table with 0(1) worst case access time. J. ACM 31, 3 (July), 538–544.
12. Forer, M.Raghavachari, B. 1992. Approximating the minimum degree spanning tree to within one from the optimal degree. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (Orlando. Fla. Jan. 27–29). ACM-SIAM, New York, pp. 317–324.
13. Ital A, and Arodeh, M. 1978. Finding a minimum circuit in a graph. SIAM J. Comput. 7, 413–423.
14. Johnson, J.D. S. 1987. The NP-completeness column: An ongoing guide. The many faces of polynomial time. J. Algorithms 8, 285–303.
15. Larger, D., Motwani, R., and Ramkumar, G. D. S. 1993. On approximating the longest path in a graph. In Proceedings of the Workshop on Algorithms and Data Structures (Montreal, Que., Canada). Lecture Notes in Computer Science, vol 709. Sprmger-Verla: g, New York, pp. 421–432.
16. Manjla, M.D. W., and beck, L. L. 1983. Smallest-last ordering and clustering and graph coloring algorithms. I. ACM 30, 3 (July), 417–427.
17. Monien, B. 1985. How to find long paths efficiently. Ann. Disc. Math. 25, 239–254.
18. Naor, J.Naor, M. 1990. Small-bias probability spaces: Efficient constructions and applications. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (Baltimore, Md., May 14–16). ACM, New York, pp. 213–223.
19. Papadimitriou, P.C. H. and yannakakis,1981 The clique problem for planar graphs. Inf Proc. Lett. 13, 131–133.
20. Papadimitriou, P.C. H. and yannakakis, M. 1993. On limited nondeterminism and the complexity of the V-C dimension. In Proceedings of the 8th Annual Symposium on Structure in Complexity Theory> (San Diego, Calif.). IEEE, Los Alamitos, Calif., pp. 12–18.
21. Plehn, J.Voigt, B. 1990. Finding minimally weighted subgraphs. In Proceedings of the 16th Workshop on Graph Theoretical Concepts in Computer Science. Lecture Notes in Computer Science, vol 484 Springer-Verlag, New York, pp. 18–29.
22. Richards D. 1986. Finding short cyclesa planar graph using separators. J. Algorithms 7, 382–394.
23. Robertson, N.Seymour, P. 1986a. Graph minors. II. Algorithmic aspects of tree-width J. Algorithms 7, 309–322.
24. Robertson, N.Seymour, P. 1986b. Graph minors. V. Excluding a planar graph. J. Comhin. Theory, Ser. B 41, 92–114.
25. Schmidt, J. P. And Siegel, A. 1990. The spatial complexity of oblivious Gprobe hash functions, SIAM J. Computing 19, 5 775–786.
26. Yuster, R.Zwick, u. 1994. Finding even cycles even faster. In Proceedings of the 21st International Colloquium on Automata, Languages and Programming (Jerusalem, Israel). Lecture Notes in Computer Science, vol. 820. Springer-Verlag, New York, pp. 532–543.