All Questions

Take a standard network flow problem: a directed graph with nonnegative capacities on each edge, a source $s$, a sink $t$. We all know how to find the maximum flow from $s$ to $t$. Now add edge-pair ...

Definition 1: A clutter $C$ is said to have the packing property if $C$ and all of its minors satisfy the König property. where, vertex cover of $C$ is a set of vertices that have non-empty ...

It is known, that maximal matchings (i.e. matchings with the maximal number of edges) and optimal matchings (i.e. matchings for which the sum of edge weights is optimal) can be calculated in ...