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 条

[31] Computing A Near-Maximum Independent Set In Dynamic Graphs
Zheng, Weiguo
Piao, Chengzhi
Cheng, Hong
Yu, Jeffrey Xu
2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2019), 2019, : 76 - 87
[32] AN APPROXIMATION ALGORITHM FOR THE MAXIMUM INDEPENDENT SET PROBLEM ON PLANAR GRAPHS
CHIBA, N
NISHIZEKI, T
SAITO, N
SIAM JOURNAL ON COMPUTING, 1982, 11 (04) : 663 - 675
[33] Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs
Dobrev, Stefan
Kralovic, Rastislav
Kralovic, Richard
THEORY OF COMPUTING SYSTEMS, 2015, 56 (01) : 197 - 219
[34] An algorithm for the maximum weight independent set problem on outerstring graphs
Keil, J. Mark
Mitchell, Joseph S. B.
Pradhan, Dinabandhu
Vatshelle, Martin
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2017, 60 : 19 - 25
[35] Mobile Agents on Chordal Graphs: Maximum Independent Set and Beyond
Kaur, Tanvir
Paul, Kaustav
Mondal, Kaushik
DISTRIBUTED COMPUTING AND INTELLIGENT TECHNOLOGY, ICDCIT 2025, 2025, 15507 : 92 - 107
[36] A Faster Algorithm for Maximum Independent Set on Interval Filament Graphs
Best D.
Ward M.
Journal of Graph Algorithms and Applications, 2022, 26 (01) : 199 - 205
[37] Rydberg quantum wires for maximum independent set problems
Kim, Minhyuk
Kim, Kangheun
Hwang, Jaeyong
Moon, Eun-Gook
Ahn, Jaewook
NATURE PHYSICS, 2022, 18 (07) : 755 - +
[38] Rydberg quantum wires for maximum independent set problems
Minhyuk Kim
Kangheun Kim
Jaeyong Hwang
Eun-Gook Moon
Jaewook Ahn
Nature Physics, 2022, 18 : 755 - 759
[39] A Modified Genetic Algorithm for Maximum Independent Set Problems
刘兴钊
坂本明雄
岛本隆
Journal of Harbin Institute of Technology, 1999, (02) : 5 - 10
[40] Note on the improvement of the maximum independent set's approximation ratio
Paschos, V.
Yugoslav Journal of Operations Research, 1995, 5 (01)

← 1 2 3 4 5 →