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 条
  • [41] Subgraph extraction and metaheuristics for the maximum clique problem
    Dang, Duc-Cuong
    Moukrim, Aziz
    JOURNAL OF HEURISTICS, 2012, 18 (05) : 767 - 794
  • [42] An approximation algorithm for the maximum spectral subgraph problem
    Bazgan, Cristina
    Beaujean, Paul
    Gourdin, Eric
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (03) : 1880 - 1899
  • [43] A genetic approach to the maximum common subgraph problem
    Valenti, Cesare
    COMPUTER SYSTEMS AND TECHNOLOGIES, 2019, : 98 - 104
  • [44] Tight bounds for the maximum acyclic subgraph problem
    Berger, B
    Shor, PW
    JOURNAL OF ALGORITHMS, 1997, 25 (01) : 1 - 18
  • [45] An approximation algorithm for the maximum spectral subgraph problem
    Cristina Bazgan
    Paul Beaujean
    Éric Gourdin
    Journal of Combinatorial Optimization, 2022, 44 : 1880 - 1899
  • [46] Complexity and inapproximability results for balanced connected subgraph problem
    Martinod, T.
    Pollet, V
    Darties, B.
    Giroudeau, R.
    Konig, J-C
    THEORETICAL COMPUTER SCIENCE, 2021, 886 : 69 - 83
  • [47] The maximum spectral radius of graphs of given size with forbidden subgraph
    Fang, Xiaona
    You, Lihua
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2023, 666 : 114 - 128
  • [48] Exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs
    Fernau, Henning
    Raible, Daniel
    WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 4921 : 144 - +
  • [49] Improved hardness for H-colourings of G-colourable graphs
    Wrochna, Marcin
    Zivny, Stanislav
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1426 - 1435
  • [50] Improved hardness for H-colourings of G-colourable graphs
    Wrochna, Marcin
    Zivny, Stanislav
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1426 - 1435
12345