-
### Feature description
## Description
I would like to propose adding an implementation of Edmonds' Blossom Algorithm to our codebase. This algorithm efficiently finds the maximum matching in genera…
-
Implement the well-known Blossom algorithm for maximum weight (perfect) matching in generic graphs.
- wiki link: https://en.wikipedia.org/wiki/Blossom_algorithm
- many simple (not-optimized) imple…
-
In tracing through the algorithm as part of an earlier internal PR, @karalekas suggested a couple of assertions that could be made while respecting memory locality:
* When installing a master edge,…
-
A maximum matching (also known as maximum-cardinality) matching is a matching that contains the largest possible number of edges. Now, _igraph/c_ only has `igraph_maximum_bipartite_matching`, not for …
-
_Andrew Chen_
_October 2024_
# Introduction
The [Procedures for Power-Pairing at the World Schools Debating Championships](https://www.wsdcdebating.org/_files/ugd/669183_ddad163e901b4e00b7cdaed…
-
I've started working on a [notebook](https://github.com/padath314/NetworkX-contribution/blob/main/GraphMatching.ipynb) about the Graph Matching algorithm and have been using the following Wikipedia pa…
-
### Summary
I would like to be able to detect if a graph has a perfect matching. With this ability I can answer related questions about graphs.
### Motivation
For a graph `G`, a [matching](https:…
-
**What is the feature or improvement you would like to see?**
`igraph_contract_vertices()` requires a mapping as input. This is almost always inconvenient. There should be alternative interfaces to…
-
A possible O(|V|_|E|_log(|V|)) algorithm can be found in:
Zvi Galil, Efficient algorithms for finding maximum matching in graphs, ACM Computing Surveys, 1986.
A Python implementation of the algorith…
-
I pushed a bunch of edits yesterday. Here are two things I didn't change but maybe we should?
* Since the algorithm proceeds _backwards_ in time, should Figure 1 be flipped? Otherwise it needs to b…