Skip to content
#

kmm

Here are 397 public repositories matching this topic...

The Maximum Matching algorithm finds the largest possible set of edges in a graph with no common vertices. It has applications in computer science, mathematics, and operations research and can be solved efficiently with algorithms such as augmenting path and Hopcroft-Karp with a time complexity of O(E√V).

  • Updated Feb 9, 2023
  • Kotlin

The Knuth-Morris-Pratt (KMP) algorithm is a linear time pattern matching algorithm that efficiently searches for occurrences of a pattern in a text. It pre-processes the pattern to determine a partial match table which is used to quickly skip over sections of the text that cannot match the pattern.

  • Updated Feb 10, 2023
  • Kotlin

Improve this page

Add a description, image, and links to the kmm topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the kmm topic, visit your repo's landing page and select "manage topics."

Learn more