The minimum maximal k-partial-matching problem
In this paper, we introduce a new problem related to bipartite graphs called minimum maximal k-partial-matching (MMKPM) which has been modelled by using a relaxation of the concept of matching in a graph. The MMKPM problem can be viewed as a generalization of the classical Hitting Set and Set Cover...
| Authors: | , |
|---|---|
| Format: | article |
| Status: | Versión enviada para evaluación y publicación |
| Publication Date: | 2013 |
| Country: | España |
| Institution: | Universidad de Sevilla (US) |
| Repository: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/90799 |
| Online Access: | https://hdl.handle.net/11441/90799 https://doi.org/10.1007/s11590-012-0531-3 |
| Access Level: | Open access |
| Keyword: | Bipartite graph Partial-matching NP-completeness Hitting set Set Cover Finite state machine |
| Summary: | In this paper, we introduce a new problem related to bipartite graphs called minimum maximal k-partial-matching (MMKPM) which has been modelled by using a relaxation of the concept of matching in a graph. The MMKPM problem can be viewed as a generalization of the classical Hitting Set and Set Cover problems. This property has been used to prove that the MMKPM problem is NPComplete. An integer linear programming formulation and a greedy algorithm have been proposed. The problem can be applied to the design process of finite state machines with input multiplexing for simplifying the complexity of multiplexers. |
|---|