We show new algorithms and constructions over linear delta-matroids. We observe an
alternative representation for linear delta-matroids, as a contraction representation over a …

The matroid parity (or matroid matching) problem, introduced as a common generalization of
matching and matroid intersection problems, is so general that it requires an exponential …

Mader's disjoint \calS-paths problem is a common generalization of non-bipartite matching
and Menger's disjoint paths problems. Lovász J. Combin. Theory Ser. B, 28 (1980), pp. 208 …

Given an undirected graph $ G=(V, E) $ with a set of terminals $ T\subseteq V $ partitioned
into a family $\mathcal {S} $ of disjoint blocks, find the maximum number of vertex-disjoint …

The parity of the length of paths and cycles is a classical and well-studied topic in graph
theory and theoretical computer science. The parity constraints can be extended to label …

Mader's disjoint S-paths problem unifies two generalizations of bipartite matching:(a) non-
bipartite matching and (b) disjoint s–t paths. Lovász (1980, 1981) first proposed an efficient …

We study a constrained shortest path problem in group-labeled graphs with nonnegative
edge length, called the shortest non-zero path problem. Depending on the group in …

Let G=(V, E) be a multigraph with a set T⊆ V of terminals. A path in G is called a T-path if its
ends are distinct vertices in T and no internal vertices belong to T. In 1978, Mader showed a …

We study a constrained shortest path problem in group-labeled graphs with nonnegative
edge length, called the shortest non-zero path problem. Depending on the group in …

The parity of the length of paths and cycles is a classical and well-studied topic in graph
theory and theoretical computer science. The parity constraints can be extended to the label …