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 条
  • [41] A note on greedy algorithms for the maximum weighted independent set problem
    Sakai, S
    Togasaki, M
    Yamazaki, K
    DISCRETE APPLIED MATHEMATICS, 2003, 126 (2-3) : 313 - 322
  • [42] An exact algorithm for maximum independent set in degree-5 graphs
    Xiao, Mingyu
    Nagamochi, Hiroshi
    DISCRETE APPLIED MATHEMATICS, 2016, 199 : 137 - 155
  • [43] AN APPROXIMATION ALGORITHM FOR THE MAXIMUM INDEPENDENT SET PROBLEM IN CUBIC PLANAR GRAPHS
    CHOUKHMANE, E
    FRANCO, J
    NETWORKS, 1986, 16 (04) : 349 - 356
  • [44] Approximating minimum coloring and maximum independent set in dotted interval graphs
    Jiang, MH
    INFORMATION PROCESSING LETTERS, 2006, 98 (01) : 29 - 33
  • [45] Distributed minimum vertex coloring and maximum independent set in chordal graphs
    Konrad, Christian
    Zamaraev, Viktor
    THEORETICAL COMPUTER SCIENCE, 2022, 922 : 486 - 502
  • [46] Graphs Without Large Apples and the Maximum Weight Independent Set Problem
    Lozin, Vadim V.
    Milanic, Martin
    Purcell, Christopher
    GRAPHS AND COMBINATORICS, 2014, 30 (02) : 395 - 410
  • [47] On maximum independent set of categorical product and ultimate categorical ratios of graphs
    Hon, Wing-Kai
    Kloks, Ton
    Liu, Ching-Hao
    Liu, Hsiang-Hsuan
    Poon, Sheung-Hung
    Wang, Yue-Li
    THEORETICAL COMPUTER SCIENCE, 2015, 588 : 81 - 95
  • [48] Graphs Without Large Apples and the Maximum Weight Independent Set Problem
    Vadim V. Lozin
    Martin Milanič
    Christopher Purcell
    Graphs and Combinatorics, 2014, 30 : 395 - 410
  • [49] Further Improvement on Maximum Independent Set in Degree-4 Graphs
    Xiao, Mingyu
    Nagamochi, Hiroshi
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 2011, 6831 : 163 - +
  • [50] A refined algorithm for maximum independent set in degree-4 graphs
    Xiao, Mingyu
    Nagamochi, Hiorshi
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (03) : 830 - 873
12345