SMAWK algorithm - Wikipedia

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)

This article possibly contains original research. Please improve it by verifying the claims made and adding inline citations. Statements consisting only of original research should be removed. (July 2013) (Learn how and when to remove this message)

The topic of this article may not meet Wikipedia's general notability guideline. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted.
Find sources: "SMAWK algorithm" – news · newspapers · books · scholar · JSTOR (July 2013) (Learn how and when to remove this message)

This article is an orphan, as no other articles link to it. Please introduce links to this page from related articles. (July 2013)

(Learn how and when to remove this message)

Introduction

The SMAWK algorithm finds all row minima of a totally monotone matrix, such as the one below. The name “SMAWK” is an acronym consisting of the first letters of the last names of the five developers of the algorithm.

This article has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar articles, in addition to a stub category. (July 2013)

This mathematics-related article is a stub. You can help Wikipedia by expanding it.