An efficient algorithm for maxdominance, with applications
- 1 June 1989
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 4 (1) , 221-236
- https://doi.org/10.1007/bf01553888
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Fast algorithms for computing the largest empty rectanglePublished by Association for Computing Machinery (ACM) ,1987
- Computing the Largest Empty RectangleSIAM Journal on Computing, 1986
- A note on finding a maximum empty rectangleDiscrete Applied Mathematics, 1986
- Domination in permutation graphsJournal of Algorithms, 1985
- On the maximum empty rectangle problemDiscrete Applied Mathematics, 1984
- Computing on a free tree via complexity-preserving mappingsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Some modified algorithms for Dijkstra's longest upsequence problemActa Informatica, 1982
- Maintenance of configurations in the planeJournal of Computer and System Sciences, 1981
- Some beautiful arguments using mathematical inductionActa Informatica, 1980