Summary: '
&
$
%
Matching
Adnan Aziz
The University of Texas at Austin
Interconnection Networks Matching 1 of 12
'
&
$
%
Background
Undirected graph G = (V, E) is bipartite if V can be
partitioned into U and W such that all e E have one end
point in U and one in W
· easily checked -- run DFS, alternately assign red and
blue to vertices; conflict iff nonbipartite
M E is a matching if no two edges in M have a vertex in
common

Source: Aziz, Adnan - Department of Electrical and Computer Engineering, University of Texas at Austin

Collections: Computer Technologies and Information Sciences