-
1 алгоритм нахождения максимального покрытия
Русско-английский большой базовый словарь > алгоритм нахождения максимального покрытия
-
2 алгоритм нахождения максимального покрытия
Graph theory: maximum matching algorithmУниверсальный русско-английский словарь > алгоритм нахождения максимального покрытия
-
3 алгоритм построения паросочетания с максимальным весом
Mathematics: maximum weight matching algorithmУниверсальный русско-английский словарь > алгоритм построения паросочетания с максимальным весом
См. также в других словарях:
Matching (graph theory) — In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Covering packing dualities… … Wikipedia
Maximum flow problem — An example of a flow network with a maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, the maximum flow problem is to find a feasible flow through a single source, single sink flow network … Wikipedia
Matching (Graphentheorie) — Die Theorie um das Finden von Matchings in Graphen ist in der diskreten Mathematik ein umfangreiches Teilgebiet, das in die Graphentheorie eingeordnet wird. Folgende Situation wird dabei betrachtet: Gegeben eine Menge von Dingen und zu diesen… … Deutsch Wikipedia
Matching pursuit — Signal reconstruction with matching pursuit algorithm. Matching pursuit is a type of numerical technique which involves finding the best matching projections of multidimensional data onto an over complete dictionary D. The basic idea is to… … Wikipedia
Maximum length sequence — A maximum length sequence (MLS) is a type of pseudorandom binary sequence. They are bit sequences generated using maximal linear feedback shift registers and are so called because they are periodic and reproduce every binary sequence that can be… … Wikipedia
Hopcroft–Karp algorithm — The Hopcroft–Karp algorithm finds maximum cardinality matchings in bipartite graphs in O(sqrt{V} E) time, where V is the number of vertices and E is the number of edges of the graph. [John E. Hopcroft, Richard M. Karp: An n^{5/2} Algorithm for… … Wikipedia
Auction algorithm — The term auction algorithm applies to several variations of a combinatorial optimization algorithm which solves assignment problems, including forward/reverse auction algorithms. An auction algorithm has been used in a business setting to… … Wikipedia
National Resident Matching Program — The National Resident Matching Program (NRMP) (or the Match[1]) is a United States based non profit non governmental organization created in 1952 to help match medical school students with residency programs. The NRMP is sponsored by the American … Wikipedia
Globales Matching — bezeichnet im Rahmen der Informationsintegration einen Prozess zur automatischen Abbildung verschiedener Schemas aufeinander (Schema Matching). Dabei werden Ergebnisse aus verschiedenen Matching Verfahren verwendet, um Attribute der zu matchenden … Deutsch Wikipedia
Hungarian algorithm — The Hungarian method is a combinatorial optimization algorithm which solves the assignment problem in polynomial time and which anticipated later primal dual methods. It was developed and published by Harold Kuhn in 1955, who gave the name… … Wikipedia
Knuth–Morris–Pratt algorithm — The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a word W within a main text string S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to… … Wikipedia