A note on maximum independent set and related problems on box graphs

被引：3
|
作者：
Lingas, A [1 ]
Wahlen, M [1 ]
机构：
[1] Lund Univ, Dept Comp Sci, S-22100 Lund, Sweden
来源：
INFORMATION PROCESSING LETTERS | 2005年 / 93卷 / 04期
关键词：
algorithms; analysis of algorithms; complexity;
D O I：
10.1016/j.ipl.2004.10.013
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A box graph is the intersection graph of orthogonal rectangles in the plane. We show that maximum independent set and minimum vertex cover on box graphs can be solved in subexponential time, more precisely, in time 2(O(rootn log n)), by applying Miller's simple cycle planar separator theorem [J. Comput. System Sci. 32 (1986) 265-279] (in spite of the fact that the input box graph might be strongly non-planar). (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：169 / 171
页数：3
相关论文
共 50 条
  • [1] Subexponential-time algorithms for maximum independent set and related problems on box graphs
    Lingas, A
    Wahlen, M
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2003, 2697 : 50 - 56
  • [2] Approximating the maximum independent set and minimum vertex coloring on box graphs
    Han, Xin
    Iwama, Kazuo
    Klein, Rolf
    Lingas, Andrzej
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2007, 4508 : 337 - +
  • [3] THE COLORING AND MAXIMUM INDEPENDENT SET PROBLEMS ON PLANAR PERFECT GRAPHS
    HSU, WL
    JOURNAL OF THE ACM, 1988, 35 (03) : 535 - 563
  • [4] Robust maximum weighted independent-set problems on interval graphs
    Nobibon, Fabrice Talla
    Leus, Roel
    OPTIMIZATION LETTERS, 2014, 8 (01) : 227 - 235
  • [5] Robust maximum weighted independent-set problems on interval graphs
    Fabrice Talla Nobibon
    Roel Leus
    Optimization Letters, 2014, 8 : 227 - 235
  • [6] EFFICIENT ALGORITHMS FOR THE MAXIMUM WEIGHT CLIQUE AND MAXIMUM WEIGHT INDEPENDENT SET PROBLEMS ON PERMUTATION GRAPHS
    CHANG, MS
    WANG, FH
    INFORMATION PROCESSING LETTERS, 1992, 43 (06) : 293 - 295
  • [7] Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs
    Matsui, T
    DISCRETE AND COMPUTATIONAL GEOMETRY, 2000, 1763 : 194 - 200
  • [8] The maximum independent set problem in planar graphs
    Alekseev, Vladimir E.
    Lozin, Vadim
    Malyshev, Dmitriy
    Milanic, Martin
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2008, PROCEEDINGS, 2008, 5162 : 96 - +
  • [9] On the Maximum Independent Set Problem in Graphs of Bounded Maximum Degree
    Ngoc C. Lê
    Trung Tran
    Acta Mathematica Vietnamica, 2020, 45 : 463 - 475
  • [10] Maximum independent set and maximum clique algorithms for overlap graphs
    Cenek, E
    Stewart, L
    DISCRETE APPLIED MATHEMATICS, 2003, 131 (01) : 77 - 91
12345