We consider a variant of the maximum flow problem on a given directed graph where some
arc pairs are incompatible or conflicting; in other words, they are not allowed to carry positive …

We investigate the maximum induced matching problem (MIM), which is the problem of
finding an induced matching having the largest cardinality on an undirected graph. The …

In this paper, we deal with minimum cost b-matching problems on graphs where the nodes
are assumed to belong to non-necessarily convex regions called neighborhoods, and the …

A note on the NP-hardness of two matching problems in induced subgrids Page 1 Discrete
Mathematics and Theoretical Computer Science DMTCS vol. 15:2, 2013, 233–242 A note on …

A formulation is proposed for the perfect edge domination problem and some exact
algorithms based on it are designed and tested. So far, perfect edge domination has been …

Given a weighted simple graph, the minimum weighted maximal matching (MWMM) problem
is the problem of finding a maximal matching of minimum weight. The MWMM problem is NP …

In this paper, we deal with minimum cost b-matching problems on graphs where the nodes
are assumed to belong to non-necessarily convex regions called neighborhoods, and the …

Matching problems have applications in many areas, changing from social networks to
communication networks, making them a subject of keen interest for researchers across …

Many systems or structures encountered in daily life can be represented as networks of
interconnecting objects. Power networks to distribute electricity, telecommunication/internet …

Given a graph G=(V, E), a subset M of E is called a matching if no two edges in M are
adjacent. A matching is said to be maximal if it is not a proper subset of any other matching …