• DOI:10.1007/BF01840359
Corpus ID: 7932878

Geometric applications of a matrix-searching algorithm

@article{Aggarwal1986GeometricAO,
  title={Geometric applications of a matrix-searching algorithm},
  author={A. Aggarwal and M. Klawe and S. Moran and P. Shor and Robert E. Wilber},
  journal={Algorithmica},
  year={1986},
  volume={2},
  pages={195-208}
}

• A. Aggarwal, M. Klawe, +2 authors Robert E. Wilber
• Published 1986
• Mathematics, Computer Science
• Algorithmica

LetA be a matrix with real entries and letj(i) be the index of the leftmost column containing the maximum value in rowi ofA.A is said to bemonotone ifi1 >i2 implies thatj(i1) ≥J(i2).A istotally monotone if all of its submatrices are monotone. We show that finding the maximum entry in each row of an arbitraryn xm monotone matrix requires Θ(m logn) time, whereas if the matrix is totally monotone the time is Θ(m) whenm≥n and is Θ(m(1 + log(n/m))) whenm<n. The problem of finding the maximum value… Expand

View on ACM

bioinfo.ict.ac.cn

Save to Library

Create Alert

Cite

Launch Research Feed