Finding and counting cliques and independent sets in r-uniform hypergraphs

Information Processing Letters

Volumn 99, Issue 4, 2006, Pages 130-134

  Yuster, Raphael ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Algorithms; Fast matrix multiplication; Hypergraphs

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; DATA PROCESSING; GRAPH THEORY; INFORMATION ANALYSIS; INFORMATION TECHNOLOGY;

FAST MATRIX MULTIPLICATION; FREE HYPERGRAPH; HYPERGRAPHS; RANDOM HYPERGRAPHS;

SET THEORY;

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

References (9)

1. Alon N., and Spencer J. The Probabilistic Method (1992), Wiley, New York
2. Bollobás B. Random Graphs (1985), Academic Press, London, Orlando
3. Coppersmith D., and Winograd S. Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9 3 (1990) 251-280
4. Downey R.G., and Fellows M.R. Fixed-parameter tractability and completeness. II. On completeness for W[1]. Theoret. Comput. Sci. 141 1-2 (1995) 106-131
5. Eisenbrand F., and Grandoni F. On the complexity of fixed parameter clique and dominating set. Theoret. Comput. Sci. 326 1-3 (2004) 57-67
6. Goodman A.W. On sets of acquaintances and strangers at any party. Amer. Math. Monthly 66 (1959) 778-783
7. 1 - ε. Acta Math. 182 1 (1998) 105-142
8. Jerrum M. Large cliques elude the metropolis process. Random Structures Algorithms 3 (1992) 347-359
9. Nešetřil J., and Poljak S. On the complexity of the subgraph problem. Comment. Math. Univ. Carolinae 26 2 (1992) 415-419