AbstractThe minimum covering problem in weighted graphs with n vertices is transformed in time O(n2) to the maximum matching problem with n or n + 1 vertices, and conversely
In this paper we consider the problem of computing a minimumweight vertex-cover in an n-node, weight...
. A new approximation algorithm for maximum weighted matching in general edge-weighted graphs is pre...
We deal with three aspects of the complexity of the problem of finding a maximum matching that minim...
This paper describes simple polynomial-bounded transformations between the problems of minimum edge ...
AbstractWe introduce the problem of finding a maximum weight matching in a graph such that the numbe...
This study deals with the minimum weight 1-matching/covering problem defined here as follows: given ...
AbstractA graph is called matching covered if for its every edge there is a maximum matching contain...
AbstractLet minimum, maximum, refer to the number of elements in a set and let minimal, maximal refe...
Master of ScienceDepartment of MathematicsNathan AlbinThis report relates four important problems of...
AbstractThe definitions of four previously studied parameters related to total coverings and total m...
The definitions of four previously studied parameters related to total coverings and total matchings...
. For a graph G with e edges and n vertices, and w(E) as a total edge weight, a maximum cardinality ...
In this paper, we introduce a new problem related to bipartite graphs called minimum maximal k-part...
In an n by n complete bipartite graph with independent exponentially distributed edge costs, we ask ...
AbstractKobler and Rotics gave a polytime algorithm for deciding if a graph has maximum induced matc...
In this paper we consider the problem of computing a minimumweight vertex-cover in an n-node, weight...
. A new approximation algorithm for maximum weighted matching in general edge-weighted graphs is pre...
We deal with three aspects of the complexity of the problem of finding a maximum matching that minim...
This paper describes simple polynomial-bounded transformations between the problems of minimum edge ...
AbstractWe introduce the problem of finding a maximum weight matching in a graph such that the numbe...
This study deals with the minimum weight 1-matching/covering problem defined here as follows: given ...
AbstractA graph is called matching covered if for its every edge there is a maximum matching contain...
AbstractLet minimum, maximum, refer to the number of elements in a set and let minimal, maximal refe...
Master of ScienceDepartment of MathematicsNathan AlbinThis report relates four important problems of...
AbstractThe definitions of four previously studied parameters related to total coverings and total m...
The definitions of four previously studied parameters related to total coverings and total matchings...
. For a graph G with e edges and n vertices, and w(E) as a total edge weight, a maximum cardinality ...
In this paper, we introduce a new problem related to bipartite graphs called minimum maximal k-part...
In an n by n complete bipartite graph with independent exponentially distributed edge costs, we ask ...
AbstractKobler and Rotics gave a polytime algorithm for deciding if a graph has maximum induced matc...
In this paper we consider the problem of computing a minimumweight vertex-cover in an n-node, weight...
. A new approximation algorithm for maximum weighted matching in general edge-weighted graphs is pre...
We deal with three aspects of the complexity of the problem of finding a maximum matching that minim...
DOI
Add to ORKG