Maximum h-colourable subgraph problem in balanced graphs

被引：24
|
作者：
Dahlhaus, E
Manuel, PD
Miller, M [1 ]
机构：
[1] Univ Newcastle, Dept Comp Sci, Newcastle, NSW 2308, Australia
[2] Univ Bonn, Basser Dept comp Sci 5, D-5300 Bonn, Germany
来源：
INFORMATION PROCESSING LETTERS | 1998年 / 65卷 / 06期
关键词：
balanced graph; strongly chordal graph; balanced matrix; totally balanced matrix; k-fold clique transversal problem; maximum h-colourable subgraph problem;
D O I：
10.1016/S0020-0190(98)00019-2
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The k-fold clique transversal problem is to locate a minimum set Omega of vertices of a graph such that every maximal clique has at least k elements of Omega. The maximum h-colourable subgraph problem is to find a maximum subgraph of a graph which is h-colourable. We show that the k-fold clique transversal problem and the maximum h-colourable subgraph problem are polynomially solvable on balanced graphs. We also provide a polynomial algorithm to recognize balanced graphs. (C) 1998 Elsevier Science B.V.
引用
收藏
页码：301 / 303
页数：3
相关论文
共 50 条
  • [21] On the complexity of the maximum biplanar subgraph problem
    Yu, CW
    INFORMATION SCIENCES, 2000, 129 (1-4) : 239 - 250
  • [22] On random intersection graphs: The subgraph problem
    Karonski, M
    Scheinerman, ER
    Singer-Cohen, KB
    COMBINATORICS PROBABILITY & COMPUTING, 1999, 8 (1-2): : 131 - 159
  • [23] ON THE APPROXIMABILITY OF THE MAXIMUM COMMON SUBGRAPH PROBLEM
    KANN, V
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 577 : 377 - 388
  • [24] Maximum weight archipelago subgraph problem
    Hammer, Peter L.
    Majlender, Peter
    Simeone, Bruno
    Vizvari, Bela
    ANNALS OF OPERATIONS RESEARCH, 2014, 217 (01) : 253 - 262
  • [25] Maximum weight archipelago subgraph problem
    Peter L. Hammer
    Péter Majlender
    Bruno Simeone
    Béla Vizvári
    Annals of Operations Research, 2014, 217 : 253 - 262
  • [26] Heuristics for the maximum outerplanar subgraph problem
    Poranen, T
    JOURNAL OF HEURISTICS, 2005, 11 (01) : 59 - 88
  • [27] APPROXIMATIONS FOR THE MAXIMUM ACYCLIN SUBGRAPH PROBLEM
    HASSIN, R
    RUBINSTEIN, S
    INFORMATION PROCESSING LETTERS, 1994, 51 (03) : 133 - 140
  • [28] Heuristics for the Maximum Outerplanar Subgraph Problem
    Timo Poranen
    Journal of Heuristics, 2005, 11 : 59 - 88
  • [29] Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs
    Zhou, Yi
    Rossi, Andre
    Hao, Jin-Kao
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 269 (03) : 834 - 843
  • [30] Ascending Subgraph Decompositions in Oriented Complete Balanced Tripartite Graphs
    Brian C. Wagner
    Graphs and Combinatorics, 2013, 29 : 1549 - 1555
12345