Superlinear bounds for matrix searching problems

DOI10.1016/0196-6774(92)90005-WMaRDI QIDQ3990615zbMATH OpenOpenAlexFDO

Authors Maria M. Klawe

Publication date 28 June 1992

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(92)90005-w

zbMATH Keywords

computational geometryMatrix searchingtotally monotone partial matrices

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Combinatorial optimization (90C27) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• An Almost Linear Time Algorithm for Generalized Matrix Searching
• Geometric applications of a matrix-searching algorithm
• scientific article; zbMATH DE number 2102769
• More Efficient Parallel Totally Monotone Matrix Searching
• Applications of generalized matrix searching to geometric algorithms

Cited in

(10)

• Geometric applications of a matrix-searching algorithm
• An Almost Linear Time Algorithm for Generalized Matrix Searching
• Selection and sorting in totally monotone arrays
• On Finding Supernodes for Sparse Matrix Computations
• scientific article; zbMATH DE number 2102769 (Why is no real title available?)
• Submatrix maximum queries in Monge and partial Monge matrices are equivalent to predecessor search
• Improved submatrix maximum queries in Monge matrices
• Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
• Applications of generalized matrix searching to geometric algorithms
• An optimal algorithm with unknown time complexity for convex matrix searching

This page was built for publication: Superlinear bounds for matrix searching problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990615)