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...

Descripción completa

Detalles Bibliográficos
Autores: García Vargas, Ignacio, Senhadji Navarro, Raouf
Tipo de recurso: artículo
Estado:Versión enviada para evaluación y publicación
Fecha de publicación:2013
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/90799
Acceso en línea:https://hdl.handle.net/11441/90799
https://doi.org/10.1007/s11590-012-0531-3
Access Level:acceso abierto
Palabra clave:Bipartite graph
Partial-matching
NP-completeness
Hitting set
Set Cover
Finite state machine
id ES_4b06b2f4e87ab4f2676cbdb431e3f161
oai_identifier_str oai:idus.us.es:11441/90799
network_acronym_str ES
network_name_str España
repository_id_str
spelling The minimum maximal k-partial-matching problemGarcía Vargas, IgnacioSenhadji Navarro, RaoufBipartite graphPartial-matchingNP-completenessHitting setSet CoverFinite state machineIn 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.SpringerArquitectura y Tecnología de Computadores2013info:eu-repo/semantics/articleinfo:eu-repo/semantics/submittedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/90799https://doi.org/10.1007/s11590-012-0531-3reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésOptimization letters, 7 (8), 1959-1968.https://link.springer.com/article/10.1007/s11590-012-0531-3info:eu-repo/semantics/openAccessoai:idus.us.es:11441/907992026-06-17T12:51:07Z
dc.title.none.fl_str_mv The minimum maximal k-partial-matching problem
title The minimum maximal k-partial-matching problem
spellingShingle The minimum maximal k-partial-matching problem
García Vargas, Ignacio
Bipartite graph
Partial-matching
NP-completeness
Hitting set
Set Cover
Finite state machine
title_short The minimum maximal k-partial-matching problem
title_full The minimum maximal k-partial-matching problem
title_fullStr The minimum maximal k-partial-matching problem
title_full_unstemmed The minimum maximal k-partial-matching problem
title_sort The minimum maximal k-partial-matching problem
dc.creator.none.fl_str_mv García Vargas, Ignacio
Senhadji Navarro, Raouf
author García Vargas, Ignacio
author_facet García Vargas, Ignacio
Senhadji Navarro, Raouf
author_role author
author2 Senhadji Navarro, Raouf
author2_role author
dc.contributor.none.fl_str_mv Arquitectura y Tecnología de Computadores
dc.subject.none.fl_str_mv Bipartite graph
Partial-matching
NP-completeness
Hitting set
Set Cover
Finite state machine
topic Bipartite graph
Partial-matching
NP-completeness
Hitting set
Set Cover
Finite state machine
description 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.
publishDate 2013
dc.date.none.fl_str_mv 2013
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/submittedVersion
format article
status_str submittedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/90799
https://doi.org/10.1007/s11590-012-0531-3
url https://hdl.handle.net/11441/90799
https://doi.org/10.1007/s11590-012-0531-3
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Optimization letters, 7 (8), 1959-1968.
https://link.springer.com/article/10.1007/s11590-012-0531-3
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869407532597903360
score 15,300724

Similares en LA Referencia