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 83933
0
votes
Accepted
How to find maximum matching edges in undirected tree
It is correct and runs in linear time. You can run a DFS to find the height and the parent node of each vertex and visit the vertices according to their heights in ascending order.
The correctness o …
- 4,662
4
votes
Accepted
Winning strategy for a given game on graphs
The short answer is, Player two wins if and only if the corresponding graph admits a matching that "covers" the set $H$.
Here is a bit of explanation.
Your idea is almost right. However, the proof …
- 4,662
2
votes
Bipartite graph minimal amount of vertices required
This problem is NP-Hard. I will present a simple reduction from the vertex-cover problem to this problem. This reduction shows that there is probably no polynomial time algorithm for this problem, sin …
- 4,662
2
votes
Accepted
An example where the algorithm of Hopcroft and Karp performs poorly?
I was able to construct a simple example where the algorithm taken literally is easy to trick. The case goes as follows. Given a bipartite graph consisting of a union of simple paths of odd lengths $P …
- 4,662