Bicolored independent sets and bicliques

被引：2
|
作者：
Couturier, Jean-Francois [1 ]
Kratsch, Dieter [1 ]
机构：
[1] Univ Paul Verlaine Metz, Lab Informat Theor & Appl, F-57045 Metz 01, France
来源：
INFORMATION PROCESSING LETTERS | 2012年 / 112卷 / 8-9期
关键词：
Graph algorithms; Exact exponential algorithms; Independent set; Biclique; EXACT ALGORITHMS; GENERATION; BIPARTITE;
D O I：
10.1016/j.ipl.2012.01.010
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：329 / 334
页数：6
相关论文
共 50 条
12345