On Gallery Watchmen in grids
- 20 August 1986
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 23 (2) , 99-102
- https://doi.org/10.1016/0020-0190(86)90050-5
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Computational complexity of art gallery problemsIEEE Transactions on Information Theory, 1986
- Traditional Galleries Require Fewer WatchmenSIAM Journal on Algebraic Discrete Methods, 1983
- Some NP-hard polygon decomposition problemsIEEE Transactions on Information Theory, 1983
- An efficient algorithm for decomposing a polygon into star-shaped polygonsPattern Recognition, 1981
- A short proof of Chvátal's Watchman TheoremJournal of Combinatorial Theory, Series B, 1978
- A combinatorial theorem in plane geometryJournal of Combinatorial Theory, Series B, 1975
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973