Priority matching
id:
priority-matching-297-14485641
title:
Priority matching
text:
In graph theory, a priority matching is a matching that maximizes the number of high-priority vertices that participate in the matching. Formally, we are given a graph G =, and a partition of the vertex-set V into some k subsets, V1, …, Vk, called priority classes. A priority matching is a matching that, among all possible matchings, saturates the largest number of vertices from V1; subject to this, it saturates the largest number of vertices from V2; subject to this, it saturates the largest nu
brand slug:
wiki
category slug:
encyclopedia
description:
Graph matching with max number of high-priority vertices
original url:
https://en.wikipedia.org/wiki/Priority_matching
date created:
date modified:
2023-11-30T01:45:32Z
main entity:
{"identifier":"Q104854318","url":"https://www.wikidata.org/entity/Q104854318"}
image:
fields total:
13
integrity:
14