AbstractA matroid generalization is given to a theorem of Mendelsohn and Dulmage concerning assignments in bipartite graphs. The generalized theorem has applications to optimization theory and provides a simple proof of a theorem of Nash-Williams
Abstract▵-matroids are set systems S = (V, F), where V is a finite set and ⊘ ≠ F ⊆ P(V), characteriz...
AbstractIn this paper, we prove a generalization of the familiar marriage theorem. One way of statin...
AbstractΔ-matroids are combinatorial structures which generalize matroids. This paper associates a Δ...
AbstractA matroid generalization is given to a theorem of Mendelsohn and Dulmage concerning assignme...
AbstractFor a given graph G(V,E) and a given vector x∈Rv the problem of finding a hyperplane which s...
AbstractLet H=(V,E) be a hypergraph and let k⩾1 and l⩾0 be fixed integers. Let M be the matroid with...
AbstractThe polymatroid matching problem, also known as the matchoid problem or the matroid parity p...
AbstractWe survey recent developments in the fields of bipartite matchings, linear sum assignment an...
AbstractWe present an elementary proof of the well-known theorem of Edmonds and Fulkerson that a mat...
The Dulmage-Mendelsohn decomposition is a classical canonical decomposition in matching theory appli...
AbstractIn 1781 the French mathematician G. Monge gave an optimality criterion and a greedy-like pro...
AbstractWe study the problem of optimizing nonlinear objective functions over bipartite matchings. W...
AbstractThe two main results of this paper identify the “strict gammoids” of Mason [7] with duals of...
AbstractThis paper is devoted to a simple alternative proof for a theorem of Frank and Tardos (Math....
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Abstract▵-matroids are set systems S = (V, F), where V is a finite set and ⊘ ≠ F ⊆ P(V), characteriz...
AbstractIn this paper, we prove a generalization of the familiar marriage theorem. One way of statin...
AbstractΔ-matroids are combinatorial structures which generalize matroids. This paper associates a Δ...
AbstractA matroid generalization is given to a theorem of Mendelsohn and Dulmage concerning assignme...
AbstractFor a given graph G(V,E) and a given vector x∈Rv the problem of finding a hyperplane which s...
AbstractLet H=(V,E) be a hypergraph and let k⩾1 and l⩾0 be fixed integers. Let M be the matroid with...
AbstractThe polymatroid matching problem, also known as the matchoid problem or the matroid parity p...
AbstractWe survey recent developments in the fields of bipartite matchings, linear sum assignment an...
AbstractWe present an elementary proof of the well-known theorem of Edmonds and Fulkerson that a mat...
The Dulmage-Mendelsohn decomposition is a classical canonical decomposition in matching theory appli...
AbstractIn 1781 the French mathematician G. Monge gave an optimality criterion and a greedy-like pro...
AbstractWe study the problem of optimizing nonlinear objective functions over bipartite matchings. W...
AbstractThe two main results of this paper identify the “strict gammoids” of Mason [7] with duals of...
AbstractThis paper is devoted to a simple alternative proof for a theorem of Frank and Tardos (Math....
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Abstract▵-matroids are set systems S = (V, F), where V is a finite set and ⊘ ≠ F ⊆ P(V), characteriz...
AbstractIn this paper, we prove a generalization of the familiar marriage theorem. One way of statin...
AbstractΔ-matroids are combinatorial structures which generalize matroids. This paper associates a Δ...
DOI
Add to ORKG