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

Authors:
Andrzej Lingas;Martin Wahlen
Affiliations:
Department of Computer Science, Lund University, Box 118, S-22100 Lund, Sweden;Department of Computer Science, Lund University, Box 118, S-22100 Lund, Sweden
Venue:
Information Processing Letters
Year:
2005

Citing 3
Cited 1

Computational geometry: an introduction

Computational geometry: an introduction
Finding small simple cycle separators for 2-connected planar graphs

Journal of Computer and System Sciences
Geometric Separator Theorems and Applications

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Maximum independent set of rectangles

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

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 2O(√nlogn), 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).