An efficient algorithm for finding a two-pair, and its applications
- 11 March 1991
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 31 (1) , 71-74
- https://doi.org/10.1016/0166-218x(91)90033-s
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Covering orthogonal polygons with star polygons: The perfect graph approachJournal of Computer and System Sciences, 1990
- Perfect Graphs and Orthogonally Convex CoversSIAM Journal on Discrete Mathematics, 1989