-
Magnus Wahlström, Algorithmic aspects of linear delta-matroids
Magnus Wahlström, Algorithmic aspects of linear delta-matroids
Delta-matroids are a generalization of matroids with connections to many parts of graph theory and combinatorics (such as matching theory and the structure of topological graph embeddings). Formally, a delta-matroid is a pair $D=(V,\mathcal F)$ where $\mathcal F$ is a collection of subsets of V known as "feasible sets." (They can be thought of as …