Approximating Maximum Independent Sets by Excluding Subgraphs

Authors:
Ravi B. Boppana;Magnús M. Halldórsson
Affiliations:
-;-
Venue:
SWAT '90 Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory
Year:
1990

Citing 0
Cited 4

Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Effective techniques for the generalized low-power binding problem

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Independent set of intersection graphs of convex objects in 2D

Computational Geometry: Theory and Applications
Independent set of intersection graphs of convex objects in 2D

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract