Efficient algorithms for clique problems

Information Processing Letters

Volumn 109, Issue 4, 2009, Pages 254-257

  Vassilevska, Virginia ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

Algorithms; Clique; Combinatorial problems; Graph algorithms

Indexed keywords

APPROXIMATION ALGORITHMS;

CLIQUE; COMBINATORIAL ALGORITHMS; COMBINATORIAL PROBLEMS; DISJOINT SUBGRAPHS; EFFICIENT ALGORITHMS; GRAPH ALGORITHMS; MATRIX MULTIPLICATIONS; NODE GRAPHS; PARAMETRIZED COMPLEXITIES; RANDOM ACCESS MODELS; SUBGRAPH; TIME ALGORITHMS; WINOGRAD;

COMBINATORIAL MATHEMATICS;

EID: 57749112866     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.10.014     Document Type: Article

References (22)

1. Alon N., Yuster R., and Zwick U. Color-coding. J. ACM 42 4 (1995) 844-856
2. Alon N., Yuster R., and Zwick U. Finding and counting given length cycles. Algorithmica 17 (1997) 209-223
3. Arlazarov V.L., Dinic E.A., Kronrod M.A., and Faradzev I.A. On economical construction of the transitive closure of an oriented graph. Soviet Math. Dokl. 11 (1970) 1209-1210
4. J. Basch, S. Khanna, R. Motwani, On diameter verification and boolean matrix multiplication, Report No. STAN-CS-95-1544, Department of Computer Science, Stanford University, 1995
5. T.M. Chan, All-pairs shortest paths for unweighted undirected graphs in o (m n) time, in: Proc. SODA, 2006, pp. 514-523
6. J. Chen, X. Huang, I.A. Kanj, G. Xia, Linear FPT reductions and computational lower bounds, in: Proc. STOC, 2004, pp. 212-221
7. J. Chen, S. Lu, S. Sze, F. Zhang, Improved algorithms for path, matching, and packing problems, in: Proc. SODA, 2007, pp. 298-307
8. Coppersmith D., and Winograd S. Matrix multiplication via arithmetic progressions. J. Symbolic Computation 9 3 (1990) 251-280
9. Downey R.G., and Fellows M.R. Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput. 24 4 (1995) 873-921
10. Eisenbrand F., and Grandoni F. On the complexity of fixed parameter clique and dominating set. Theoret. Comput. Sci. 326 1-3 (2004) 57-67
11. 0.288 n) independent set algorithm, in: Proc. SODA, 2006, pp. 18-25
12. Itai A., and Rodeh M. Finding a minimum circuit in a graph. SIAM J. Comput. 7 4 (1978) 413-423
13. Kloks T., Kratsch D., and Müller H. Finding and counting small induced subgraphs efficiently. Inform. Process. Lett. 74 3-4 (2000) 115-121
14. J. Kneis, D. Mölle, S. Richter, P. Rossmanith, Divide-and-color, in: WG, 2006, pp. 58-67
15. Knuth D. The Art of Computer Programming. Seminumerical Algorithms. 3rd ed. vol. 2 (1997), Addison-Wesley
16. Miscellaneous Authors. Queries and problems. SIGACT News 16 3 (1984) 38-47
17. M. Naor, L.J. Schulman, A. Srinivasan, Splitters and near-optimal derandomization, in: Proc. FOCS, 1995, pp. 182-191
18. Nešetřil J., and Poljak S. On the complexity of the subgraph problem. Comment. Math. Univ. Carolinae 26 2 (1985) 415-419
19. Robson J.M. Algorithms for maximum independent sets. J. Algorithms 7 (1986) 425-440
20. Rytter W. Fast recognition of pushdown automaton and context-free languages. Inform. and Control 67 1-3 (1985) 12-22
21. Strassen V. Gaussian elimination is not optimal. Numer. Math. 13 (1969) 354-356
22. Woeginger G.J. Space and time complexity of exact algorithms: Some open problems. Proc. IWPEC. LNCS vol. 3162 (2004) 281-290