Perfect Graphs and Orthogonally Convex Covers
From MaRDI portal
Recommendations
Cited in
(20)- Orthogonal covers by multiplication graphs
- Near perfect coverings in graphs and hypergraphs
- Polyominos and perfect graphs
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- An efficient algorithm for finding a two-pair, and its applications
- Algorithms for weakly triangulated graphs
- Staircase visibility and computation of kernels
- Covering grids and orthogonal polygons with periscope guards
- Note on covering monotone orthogonal polygons with star-shaped polygons
- A scheme for computing minimum covers within simple regions
- On orthogonally guarding orthogonal polygons with bounded treewidth
- A Scheme for Computing Minimum Covers within Simple Regions
- Linear-time 3-approximation algorithm for the \(r\)-star covering problem
- POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER
- Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem
- A hybrid heuristic for the rectilinear picture compression problem
- Efficient algorithms for shortest distance queries on special classes of polygons
- Complexities of efficient solutions of rectilinear polygon cover problems
- Equiangular lines and covers of the complete graph
- Covering orthogonal polygons with star polygons: The perfect graph approach
This page was built for publication: Perfect Graphs and Orthogonally Convex Covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3828050)
