No label defined (Q3976656)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 19225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 19225 |
Statements
26 June 1992
0 references
maximum matching
0 references
0.9142647
0 references
0 references
0.9103894
0 references
0.90777266
0 references
0.9077724
0 references
0.90142095
0 references
0.90142095
0 references
[For the entire collection see Zbl 0734.00014.] Let \(G=(V,E)\) be a finite undirected graph. A maximum matching is a maximum cardinality subset \(E_ 1\subseteq E\), s.t. all edges in \(E_ 1\) are pairwise independent, i.e. they are not incident to a common vertex. The problem of determining whether \(G\) contains \(k\) disjoint maximum matchings is \({\mathcal NP}\)-complete. A linear algorithm for solving the problems on trees is given.
0 references
