Jul 5, 2016 · Our algorithm for computing an optimal semi-matching is an implementation of the divide-and-conquer strategy whose division stage is based on ...

An optimal semi-matching is a semi-matching with degM(u) = 1 for all u ∈ U and the minimal value of . We propose a schema that allows a reduction of the ...

Algorithms are based on finding (cost-reducing) alternating paths with some properties. Maximum matchings in bipartite graphs: O(. √ n · m) by Micali and ...

A semi-matching in a bipartite graph G = (U, V, E) with n vertices and m edges is a set of edges M ⊆ E, such that each vertex in U is incident to at most one ...

Abstract: The problem of finding an optimal semi-matching is a generalization of the problem of finding classical matching in bipartite graphs.

In this paper we give an algorithm that for a graph with $n$ vertices and $m$ edges, $n\le m$, constructs a maximum $(f,g)$-semi-matching in running time $O(m\ ...

Bibliographic details on On Computing an Optimal Semi-matching.

A semi-matching in a bipartite graph G = (U, V, E) with n vertices and m edges is a set of edges M ⊆ E, such that each vertex in U is incident to at most one ...

Bokal, D., Brešar, B., Jerebic, J.: A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks. Discret.

Bokal, D., Brešar, B., Jerebic, J.: A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks. · Katrenič, J., ...