Covering orthogonal polygons with star polygons: The perfect graph approach
- 1 February 1990
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 40 (1) , 19-48
- https://doi.org/10.1016/0022-0000(90)90017-f
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- Weakly triangulated graphsJournal of Combinatorial Theory, Series B, 1985
- Decomposing a Polygon into Simpler ComponentsSIAM Journal on Computing, 1985
- It’s Hard to Color AntirectanglesSIAM Journal on Algebraic Discrete Methods, 1984
- A Class of Perfect Graphs Associated with Planar Rectilinear RegionsSIAM Journal on Algebraic Discrete Methods, 1982
- A Class of Perfect GraphsSIAM Journal on Algebraic Discrete Methods, 1982
- Covering Regions by RectanglesSIAM Journal on Algebraic Discrete Methods, 1981
- Covering Regions with SquaresSIAM Journal on Algebraic Discrete Methods, 1981
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972