| rdfs:label |
"maximum cardinality matching"@en
|
|
skos:alt |
"max matching"@en
"maximum matching"@en
|
| schema:description |
"a graph theory problem"@en
|
|
schema:date |
"2026-02-07T18:39:19+00:00"^^xsd:dateTime |
| schema:version | 2461590346 |
| wikibase:identifiers | 2 |
| wikibase:sitelinks | 2 |
| wikibase:statements | 6 |
| p:P13104 | wd:statement/Q65088751-E0A9D124-3931-41AD-B0ED-8091A1A7B762 |
| p:P1552 | wd:statement/Q65088751-4321181b-4b78-0701-699a-69c728029821 |
| p:P2671 | wd:statement/Q65088751-C34F6A44-8460-4A04-90CB-E2ABB3ADE024 |
| p:P279 | wd:statement/Q65088751-b3e86874-4be2-9c68-7ce3-8d64fb738763 |
| p:P2820 | wd:statement/Q65088751-b4de988d-428f-9818-e568-d9f254eab786 |
| p:P31 | wd:statement/Q65088751-12ce8eaf-471f-b6c9-84b2-68f0df2c8fe0 |
|
p:direct- |
<http:/ |
| wdt:P13104 | "par_13" |
| wdt:P1552 | maximum cardinality |
| wdt:P2671 | "/g/11h5rfcjb5" |
| wdt:P279 | maximal matching |
| wdt:P2820 | matching number |
| wdt:P31 | computational problem |
Download as: