We introduce the decision problem BICOLORED INDEPENDENT SET which generalizes the well-known NP-complete graph problem INDEPENDENT SET. We present an O(1.2691(n)) time algorithm solving its counting analogue #BICOLORED INDEPENDENT SET. We show how to use this algorithm to establish algorithms solving biclique counting problems and provide an O(1.2691(n)) time algorithm solving *BIPARTITE BICLIQUE and an O(1.6107(n)) time algorithm solving #NON-INDUCED BICLIQUE. (C) 2012 Elsevier B.V. All rights reserved.
机构:
Univ Illinois, Dept Math, Urbana, IL 61801 USAUniv Illinois, Dept Math, Urbana, IL 61801 USA
Balogh, Jozsef
Morris, Robert
论文数: 0引用数: 0
h-index: 0
机构:
IMPA, Rio De Janeiro, RJ, BrazilUniv Illinois, Dept Math, Urbana, IL 61801 USA
Morris, Robert
Samotij, Wojciech
论文数: 0引用数: 0
h-index: 0
机构:
Tel Aviv Univ, Sch Math Sci, IL-69978 Tel Aviv, Israel
Univ Cambridge Trinity Coll, Cambridge CB2 1TQ, EnglandUniv Illinois, Dept Math, Urbana, IL 61801 USA