Publication date
July 2003
DOI Publisher
Elsevier Science (USA). ISSN
0095-8956Abstract
AbstractA relatively simple proof is presented for the min–max theorem of Lovász on the graphic matroid parity problem
AbstractA relatively simple proof is presented for the min–max theorem of Lovász on the graphic matroid parity problem
A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof...
AbstractA subset of the vertices in a hypergraph is a cover if it intersects every edge. Let τ(H) de...
AbstractIt is known that a large class of “hard” combinatorial optimization problems can be put in t...
A simple proof is presented for the min-max theorem of Lov'asz on cacti. Instead of using the r...
AbstractA relatively simple proof is presented for the min–max theorem of Lovász on the graphic matr...
AbstractLet H=(V,E) be a hypergraph and let k⩾1 and l⩾0 be fixed integers. Let M be the matroid with...
The matroid parity (MP) problem is a powerful (and NP-hard) extension of the matching problem. Where...
AbstractFor a given graph G(V,E) and a given vector x∈Rv the problem of finding a hyperplane which s...
AbstractThis paper is devoted to a simple alternative proof for a theorem of Frank and Tardos (Math....
AbstractThe polymatroid matching problem, also known as the matchoid problem or the matroid parity p...
AbstractA graphΓisparity embeddedin a surface if a closed path in the graph is orientation preservin...
AbstractA min-max property of bipartite graphs is stated; it is a variation on the theorem of König ...
AbstractThis paper addresses a generalization of the matroid parity problem to delta-matroids. We gi...
AbstractAs a common generalization of matchings and matroid intersection, Cunningham and Geelen intr...
AbstractLower bounds on the cardinality of the maximum matchings of graphs are established in terms ...
A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof...
AbstractA subset of the vertices in a hypergraph is a cover if it intersects every edge. Let τ(H) de...
AbstractIt is known that a large class of “hard” combinatorial optimization problems can be put in t...
A simple proof is presented for the min-max theorem of Lov'asz on cacti. Instead of using the r...
AbstractA relatively simple proof is presented for the min–max theorem of Lovász on the graphic matr...
AbstractLet H=(V,E) be a hypergraph and let k⩾1 and l⩾0 be fixed integers. Let M be the matroid with...
The matroid parity (MP) problem is a powerful (and NP-hard) extension of the matching problem. Where...
AbstractFor a given graph G(V,E) and a given vector x∈Rv the problem of finding a hyperplane which s...
AbstractThis paper is devoted to a simple alternative proof for a theorem of Frank and Tardos (Math....
AbstractThe polymatroid matching problem, also known as the matchoid problem or the matroid parity p...
AbstractA graphΓisparity embeddedin a surface if a closed path in the graph is orientation preservin...
AbstractA min-max property of bipartite graphs is stated; it is a variation on the theorem of König ...
AbstractThis paper addresses a generalization of the matroid parity problem to delta-matroids. We gi...
AbstractAs a common generalization of matchings and matroid intersection, Cunningham and Geelen intr...
AbstractLower bounds on the cardinality of the maximum matchings of graphs are established in terms ...
A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof...
AbstractA subset of the vertices in a hypergraph is a cover if it intersects every edge. Let τ(H) de...
AbstractIt is known that a large class of “hard” combinatorial optimization problems can be put in t...
Add to ORKG