Noga Alon
- 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.Google Scholar
Cross Ref
- AGHP92.N. Alon, O. Goldreich, J. H~stad, 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.Google ScholarCross Ref
- AN94.N. Alon and M. Naor. Derandomization, witnesses for boolean matrix multiplication and construction of perfect hash functions. To appear in Algorithmica, 1994.Google Scholar
- Bod93.H.L. Bodlaender. On linear time minor tests with depth-first search. Journal of Algorithms, 14:1-23, 1993. Google ScholarDigital Library
- Bol78.B. Bollob~s. Extremal graph theory. Academic Press, 1978. Google ScholarDigital Library
- Bol86.B. Bollob~s. Extremal graph theory with emphasis on probabilistic methods. Regional conference series in mathematics, No. 62, American Mathematical Society, 1986.Google Scholar
- CLR90.T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to algorithms. The MIT Press, 1990. Google ScholarDigital Library
- CN85.N. Chiba and L. Nishizeki. Arboricity and subgraph listing algorithms. SlAM Journal on Computing, 14:210- 223, 1985. Google ScholarDigital Library
- DF92.R.G. Downey and M.R. Fellows. Fixedparameter intractability. In Proceedings of the 7th Annual Symposium on Structure in Complexity Theory, pages 36- 49, 1992.Google Scholar
- FKS84.M.L. Fredman, J. Koml6s, and E. Szemer#di. Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31:538-544, 1984. Google ScholarDigital Library
- 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 A CM-SIAM Symposium on Discrete Algorithms, Orlando, Florida, pages 317-324, 1992. Google ScholarDigital Library
- IR78.A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal on Computing, 7:413-423, 1978.Google ScholarCross Ref
- Joh87.D.S. Johnson. The NP-completeness column: An ongoing guide. The many faces of polynomial time. Journal of Algorithms, 8:285-303, 1987. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- MB83.D.W. Matula and L.L. Beck. Smallestlast ordering and clustering and graph coloring algorithms. Journal of the A CM, 30:417-427, 1983. Google ScholarDigital Library
- Mon85.B. Monien. How to find long paths efficiently. Annals of Discrete Mathematics, 25:239-254, 1985.Google Scholar
- NN90.J. Naor and M. Naor. Small-bias probability spaces: efficient constructions and applications. In Proceedings of the 22nd Annual A CM Symposium on Theory of Computing, pages 213-223, 1990. Google ScholarDigital Library
- PV90.J. Plehn and B. Voigt. Finding minimally weighted subgraphs. In Proc. 16th Workshop on graph theoretic concepts in computer Scie'nce, Lecture Notes in Computer Science, Vol. 484, pages 18-29. Springer, 1990. Google ScholarDigital Library
- PY81.C.H. Papadimitriou and M. Yannakakis. The clique problem for planar graphs. Information Processing Letters, 13:131-133, 1981.Google ScholarCross Ref
- 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.Google ScholarCross Ref
- Ric86.D. Richards. Finding short cycles in a planar graph using separators. Journal of Algorithms, 7:382-394, 1986.Google ScholarCross Ref
- RS86a.N. Robertson and P. Seymour. Graph minors. II. Algorithmic aspects of treewidth. Journal of Algorithms, 7:309- 322, 1986.Google ScholarCross Ref
- RS86b.N. Robertson and P. Seymour. Graph minors. V. Excluding a planar graph. journal of Combinatorial Theory, Series B, 41"92-114, 1986. Google ScholarDigital Library
- SS90.J.P. Schmidt and A. Siegel. The spatial complexity of oblivious k-probe hash functions. SIAM Journal on Computing, 19(5):775-786, 1990. Google ScholarDigital Library
- 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. Google ScholarDigital Library
Index Terms
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs
Recommendations
On Hedetniemi's conjecture and the colour template scheme
Hedetniemi's conjecture states that the chromatic number of a product of graphs is the minimum of the chromatic numbers of the factors. El-Zahar and Sauer (Combinatorica 5 (1985) 121) have shown that the chromatic number of a product of 4-chromatic ...
Bordeaux 3-color conjecture and 3-choosability
A graph G=(V,E) is list L-colorable if for a given list assignment L={L(v):v@?V}, there exists a proper coloring c of G such that c(v)@?L(v) for all v@?V. If G is list L-colorable for every list assignment with |L(v)|>=k for all v@?V, then G is said to ...
On the existence of graphs which can colour every regular graph
AbstractLet H and G be graphs. An H-colouring of G is a proper edge-colouring f : E ( G ) → E ( H ) such that for any vertex u ∈ V ( G ) there exists a vertex v ∈ V ( H ) with f ∂ G u = ∂ H v, where ∂ G u and ∂ H v respectively denote the sets ...
Comments