Color-coding: A new method for finding simple paths, cycles and other small subgraphs within large graphs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 326-335

  Alon, Noga ^a   Yuster, Raphy ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COLOR; COMPUTATION THEORY; GRAPHIC METHODS; HASH FUNCTIONS; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS); ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); GRAPH THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; RANDOM PROCESSES; SWITCHING FUNCTIONS;

EXPECTED TIME; LARGE GRAPHS; MATRIX MULTIPLICATION; PATH PROBLEMS; PLANAR GRAPH; POLYNOMIAL-TIME; RANDOMIZED ALGORITHMS; RANDOMIZED METHOD;

GRAPH THEORY; COLOR CODES;

COLOR CODING; CYCLES; PERFECT HASH FUNCTIONS; SIMPLE PATHS; SUBGRAPHS;

EID: 0028015158     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195179     Document Type: Conference Paper

References (25)

1. [ABN+92] N. Alon, J. Bruck, J. Naor, M. Naor, and R.M. Roth. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory, 38(2):509-516, 1992.
2. [AGHP92] N. Alon, O. Goldreich, J. Hastad, and R. Peralta. Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms, 3(3):289-304, 1992. Addendum in Random Structures and Algorithms, 4(1):119-120, 1993.
3. [AN94] N. Alon and M. Naor. Derandomization, witnesses for boolean matrix multiplication and construction of perfect hash functions. To appear in Algorithmica, 1994.
4. [Bod93] H.L. Bodlaender. On linear time minor tests with depth-first search. Journal of Algorithms, 14:1-23, 1993.
5. [Bol78] B. Bollobas. Extremal graph theory. Academic Press, 1978.
6. [B0I86] B. Bollobas. Extremal graph theory with emphasis on probabilistic methods. Regional conference series in mathematics, No. 62, American Mathematical Society, 1986.
7. [CLR90] T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to algorithms. The MIT Press, 1990.
8. [CN85] N. Chiba and L. Nishizeki. Arboricity and subgraph listing algorithms. SIAM Journal on Computing, 14: 210-223, 1985.
9. [DF92] R.G. Downey and M.R. Fellows. Fixed- parameter intractability. In Proceedings of the 7th Annual Symposium on Structure in Complexity Theory, pages 36-49, 1992.
10. [FKS84] M.L. Fredman, J. Komlos, and E. Szemeredi. Storing a sparse table with 0(1) worst case access time. Journal of the ACM, 31:538-544, 1984.
11. [FR92] M. Fiirer and B. Raghavachari. 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, Florida, pages 317-324, 1992.
12. [IR78] A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal on Computing, 7:413-423, 1978.
13. [Joh87] D.S. Johnson. The NP-completeness column: An ongoing guide. The many faces of polynomial time. Journal of Algorithms, 8:285-303, 1987.
14. [KMR93] D. Karger, R. Motwani, and G.D.S. Ramkumar. On approximating the longest path in a graph. In Proceedings of the Workshop on algorithms and data structures, Montreal, Canada, pages 421-432, 1993.
15. [MB83] D.W. Matula and L.L. Beck. Smallest- last ordering and clustering and graph coloring algorithms. Journal of the ACM, 30:417-427, 1983.
16. [Mon85] B. Monien. How to find long paths efficiently. Annals of Discrete Mathematics, 25:239-254, 1985.
17. [NN90] J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 213-223, 1990.
18. [PV90] J. Plehn and B. Voigt. Finding minimally weighted subgraphs. In Proc. 16th Workshop on graph theoretic concepts in computer Science, Lecture Notes in Computer Science, Vol. 484, pages 18-29. Springer, 1990.
19. [PY81] C.H. Papadimitriou and M. Yannakakis. The clique problem for planar graphs. Information Processing Letters, 13:131-133, 1981.
20. [PY93] C.H. Papadimitriou and M. Yannakakis. 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, California, pages 12-18, 1993.
21. [Ric86] D. Richards. Finding short cycles in a planar graph using separators. Journal of Algorithms, 7:382-394, 1986.
22. [RS86a] N. Robertson and P. Seymour. Graph minors. II. Algorithmic aspects of tree- width. Journal of Algorithms, 7:309-322, 1986.
23. [RS86b] N. Robertson and P. Seymour. Graph minors. V. Excluding a planar graph. Journal of Combinatorial Theory, Series B, 41: 92-114, 1986.
24. [SS90] J.P. Schmidt and A. Siegel. The spatial complexity of oblivious fc-probe hash functions. SIAM Journal on Computing, 19(5):775-786, 1990.
25. [YZ94] R. Yuster and U. Zwick. Finding even cycles even faster. In Proceedings of the 21st International Colloquium on Automata, Languages and Programming, Jerusalem, Israel, 1994. to appear.