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 条
  • [41] On the generation of bicliques of a graph
    Dias, Vania M. F.
    de Figueiredo, Celina M. H.
    Szwarcfiter, Jayme L.
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (14) : 1826 - 1832
  • [42] On Fast Enumeration of Pseudo Bicliques
    Alamgir, Zareen
    Karim, Saira
    Husnine, Syed
    COMBINATORIAL ALGORITHMS, 2011, 6460 : 256 - 259
  • [43] Critical sets, crowns and local maximum independent sets
    Vadim E. Levit
    Eugen Mandrescu
    Journal of Global Optimization, 2022, 83 : 481 - 495
  • [44] Critical sets, crowns and local maximum independent sets
    Levit, Vadim E.
    Mandrescu, Eugen
    JOURNAL OF GLOBAL OPTIMIZATION, 2022, 83 (03) : 481 - 495
  • [45] Bicolored tourmaline imitation
    Lucas, Andy
    GEMS & GEMOLOGY, 2012, 48 (01): : 59 - 60
  • [46] MAXIMALLY INDEPENDENT SETS, MINIMAL GENERATING SETS, AND IRREDUCIBLES
    ZEIGLER, BP
    MATHEMATICAL SYSTEMS THEORY, 1975, 8 (02): : 176 - 181
  • [47] Extremal Colorings and Independent Sets
    Engbers, John
    Erey, Aysel
    GRAPHS AND COMBINATORICS, 2018, 34 (06) : 1347 - 1361
  • [48] A Generalization of maximal independent sets
    Jagota, A
    Narasimhan, G
    Soltés, L
    DISCRETE APPLIED MATHEMATICS, 2001, 109 (03) : 223 - 235
  • [49] On Independent Sets in Random Graphs
    Coja-Oghlan, Amin
    Efthymiou, Charilaos
    RANDOM STRUCTURES & ALGORITHMS, 2015, 47 (03) : 436 - 486
  • [50] Graph Partitioning for Independent Sets
    Lamm, Sebastian
    Sanders, Peter
    Schulz, Christian
    EXPERIMENTAL ALGORITHMS, SEA 2015, 2015, 9125 : 68 - 81
12345