On independent sets and bicliques in graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5344 LNCS, Issue , 2008, Pages 171-182

  Gaspers, Serge ^a   Kratsch, Dieter ^b   Liedloff, Mathieu ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; TECHNICAL PRESENTATIONS;

ALGORITHMIC PROBLEMS; APPLICATIONS.; INDEPENDENT SETS; MAXIMAL INDEPENDENT SETS; OF GRAPHS; POLYNOMIAL FACTORS; TIME ALGORITHMS; TIME REDUCTIONS; TURING REDUCTIONS; UPPER BOUNDS;

COMPUTATIONAL GEOMETRY;

EID: 58349092437     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92248-3_16     Document Type: Conference Paper

References (25)

1. Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discrete Appl. Math. 145, 11-21 (2004)
2. Amilhastre, J., Vilarem, M.C., Janssen, P.: Complexity of minimum biclique cover and minimum biclique decomposition for bipartite dominofree graphs. Discrete Appl. Math. 86, 125-144 (1998)
3. Dawande, M., Swaminathan, J., Keskinocak, P., Tayur, S.: On bipartite and multipartite clique problems. J. Algorithms 41, 388-403 (2001)
4. Dias, V.M.F., Herrera de Figueiredo, C.M., Szwarcfiter, J.L.: Generating bicliques of a graph in lexicographic order. Theoret. Comput. Sci. 337, 240-248 (2005)
5. Dias, V.M.F., Herrera de Figueiredo, C.M., Szwarcfiter, J.L.: On the generation of bicliques of a graph. Discrete Appl. Math. 155, 1826-1832 (2007)
6. Fomin, F.V., Gaspers, S., Pyatkin, A.V., Razgon, I.: On the minimum feedback vertex set problem: Exact and enumeration algorithms. Algorithmica, Special Issue on Parameterized and Exact Algorithms (to appear)
7. Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: Domination - A case study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 192-203. Springer, Heidelberg (2005)
8. 0.288n) independent set algorithm. In: SODA 2006, pp. 18-25. ACM Press, New York (2006)
9. Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the Theory of NP-completeness. Freeman, New York (1979)
10. Ganter, B., Wille, R.: Formal Concept Analysis, Mathematical Foundations. Springer, Berlin (1996)
11. Gaspers, S., Liedloff, M.: A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 78-89. Springer, Heidelberg (2006)
12. Hochbaum, D.S.: Approximating clique and biclique problems. J. Algorithms 29, 174-200 (1998)
13. Hujter, M., Tuza, Z.: The number of maximal independent sets in triangle-free graphs. SIAM J. Discrete Math. 6, 284-288 (1993)
14. Johnson, D.S., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Process. Lett. 27, 119-123 (1988)
15. Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 260-272. Springer, Heidelberg (2004)
16. Moon, J.W., Moser, L.: On cliques in graphs. Israel J. Math. 3, 23-28 (1965)
17. Nourine, L., Raynaud, O.: A Fast Algorithm for Building Lattices. Inf. Process. Lett. 71, 199-204 (1999)
18. Nourine, L., Raynaud, O.: A fast incremental algorithm for building lattices. J. Exp. Theor. Artif. Intell. 14, 217-227 (2002)
19. Okamoto, Y., Uno, T., Uehara, R.: Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 433-444. Springer, Heidelberg (2005)
20. Peeters, R.: The maximum edge biclique problem is NP-complete. Discrete Appl. Math. 131, 651-654 (2003)
21. Prisner, E.: Bicliques in Graphs I: Bounds on Their Number. Combinatorica 20, 109-117 (2000)
22. Robson, J.M.: Algorithms for maximum independent sets. J. Algorithms 7, 425-440 (1986)
23. van Rooij, J.M.M., Bodlaender, H.L.: Design by measure and conquer: a faster exact algorithm for dominating set. In: Albers, S., Weil, P. (eds.) STACS 2008. IBFI, Schloss Dagstuhl, Germany, pp. 657-668 (2008)
24. Wahlström, M.: A tighter bound for counting max-weight solutions to 2SAT instances. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 202-213. Springer, Heidelberg (2008)
25. Yannakakis, M.: Node and edge deletion NP-complete problems. In: STOC 1978, pp. 253-264. ACM, New York (1978)