Search results
Jump to navigation
Jump to search
- ...ch that <math>\sum_{e\in M'}c(e)\leq\sum_{e\in M}c(e)</math> for any other matching <math>M'</math> in <math>G</math>. ...nd k-partite graphs|bipartite graphs]] is usually called the '''assignment problem'''.2 KB (264 words) - 17:37, 6 December 2014
- [[Category:Maximum matching problem]] '''Algorithmic Problem:''' [[Matchings in graphs]].1 KB (190 words) - 13:38, 27 January 2015
- * [[Matchings in graphs#Cardinality-maximal matching|Maximum matching problem]] * [[Maximum spanning forest]]4 KB (380 words) - 15:13, 30 November 2020
- '''Algorithmic problem:''' [[Cardinality-maximal matching]]4 KB (671 words) - 09:25, 22 February 2015
- '''Algorithmic problem:''' [[Maximum-weight matching]] in [[Basic graph definitions#Complete graphs|complete]] [[Basic graph def # <math>M</math> is a matching in <math>G</math> and all edges of <math>M</math> are feasible.6 KB (1,033 words) - 17:26, 27 February 2015
- '''Algorithmic problem:''' [[Cardinality-maximal matching|Cardinality-maximal matching]] in [[Basic graph definitions#Bipartite and k-partite graphs|bipartite gra7 KB (1,284 words) - 08:49, 22 February 2015
- '''Algorithmic problem:''' [[One-dimensional string matching]] # A current '''maximum prefix length''' <math>q\in \{ 0,...,m\}</math>.6 KB (1,053 words) - 14:36, 16 September 2015