Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with bipartite-matching
Search options answers only
not deleted
user 4249
2
votes
Maximum weighted matching in Bipartite Graph
You can turn the problem into an edge-weighted variant by setting the weight on edge $vu$ to be $\texttt{valueArray}(u)$ where $w(vu) = \texttt{valueArray}(u)$ is the value of $u \in U$.
Now a maximum …
- 17.1k
5
votes
Accepted
Term for a matching which is perfect on one side only
Such a matching is said to saturate one of the sides. More specifically, if $M$ is a matching of a graph $G$ and $v$ is incident to one of the edges of $M$, we say that $M$ saturates $v$. If $A$ is …
- 17.1k
1
vote
Dinitz’ algorithm in simple unit-capacity networks
I have no clue about how the values in the other two lemmas are brought up.
The how is this: What are the values $a$ and $b$ such that $ab = n$ and $O(a + b)$ is minimized?
The answer is $\sqrt n$, …
- 17.1k