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 matching
Search options not deleted
user 113335
A matching (aka **Independent Edge Set**) in a simple graph is the set of pairwise non-adjacent edges i.e. no two edges have common vertex.
0
votes
0
answers
27
views
Algorithm for b-matching on bipartite graph [duplicate]
I have a bipartite graph, where I want to assign nodes in Left set to Right set of nodes. There is a "b" constraint, which limits the maximum possible node degrees on the Right set.
Since it is a clas …
- 53
3
votes
1
answer
2k
views
one-to-many matching in bipartite graphs?
I want to map each of the $L$ vertices to one node from $R$ (one-to-many matching), with minimum total edge-costs. …
- 53
2
votes
1
answer
1k
views
Is there such a problem as b-Matching with different b values?
Naturally, a b-Matching problem is to find a set of edges $M \subset E$, such that each node in $L$ and $R$ are adjuscent to maximum $b$ neighbors, and a weight function $w(e), e \in E$ is maximized. … Is is constrained matching, or k-cardinality assignment, or what? I need to find some literature for it.
Thanks! …
- 53