An efficient algorithm for maxdominance, with applications
暂无分享,去创建一个
[1] Micha Sharir,et al. Some modified algorithms for Dijkstra's longest upsequence problem , 2004, Acta Informatica.
[2] Martin Farber,et al. Domination in Permutation Graphs , 1985, J. Algorithms.
[3] Mikhail J. Atallah,et al. New clique and independent set algorithms for circle graphs , 1992, Discret. Appl. Math..
[4] Jan van Leeuwen,et al. Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..
[5] Edsger W. Dijkstra,et al. Some beautiful arguments using mathematical induction , 2004, Acta Informatica.
[6] M. Orlowski,et al. A new algorithm for the largest empty rectangle problem , 1990, Algorithmica.
[7] Mikhail J. Atallah,et al. A note on finding a maximum empty rectangle , 1986, Discret. Appl. Math..
[8] Bernard Chazelle,et al. Computing the Largest Empty Rectangle , 1984, SIAM J. Comput..
[9] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[10] Bernard Chazelle. Computing on a Free Tree via Complexity-Preserving Mappings , 1984, FOCS.
[11] Mikhail J. Atallah,et al. Finding a minimum independent dominating set in a permutation graph , 1988, Discret. Appl. Math..
[12] Alok Aggarwal,et al. Fast algorithms for computing the largest empty rectangle , 1987, SCG '87.
[13] D. T. Lee,et al. On the maximum empty rectangle problem , 1984, Discret. Appl. Math..