Registro completo de metadatos
| Campo DC | Valor | Lengua/Idioma |
|---|---|---|
| dc.provenance | CONICET | - |
| dc.creator | Lin, Min Chih | - |
| dc.creator | Mizrahi, Michel Jonathan | - |
| dc.creator | Szwarcfiter, Jayme L. | - |
| dc.date | 2018-09-17T20:56:37Z | - |
| dc.date | 2018-09-17T20:56:37Z | - |
| dc.date | 2017-03 | - |
| dc.date | 2018-09-17T19:26:42Z | - |
| dc.date.accessioned | 2019-04-29T15:47:36Z | - |
| dc.date.available | 2019-04-29T15:47:36Z | - |
| dc.date.issued | 2017-03 | - |
| dc.identifier | Lin, Min Chih; Mizrahi, Michel Jonathan; Szwarcfiter, Jayme L.; Exact Algorithms for Minimum Weighted Dominating Induced Matching; Springer; Algorithmica; 77; 3; 3-2017; 642-660 | - |
| dc.identifier | 0178-4617 | - |
| dc.identifier | http://hdl.handle.net/11336/60000 | - |
| dc.identifier | 1432-0541 | - |
| dc.identifier | CONICET Digital | - |
| dc.identifier | CONICET | - |
| dc.identifier.uri | http://rodna.bn.gov.ar:8080/jspui/handle/bnmm/302158 | - |
| dc.description | Say that an edge of a graph G dominates itself and every other edge sharing a vertex of it. An edge dominating set of a graph G= (V, E) is a subset of edges E′⊆ E which dominates all edges of G. In particular, if every edge of G is dominated by exactly one edge of E′ then E′ is a dominating induced matching. It is known that not every graph admits a dominating induced matching, while the problem to decide if it does admit it is NP-complete. In this paper we consider the problems of counting the number of dominating induced matchings and finding a minimum weighted dominating induced matching, if any, of a graph with weighted edges. We describe three exact algorithms for general graphs. The first runs in linear time for a given vertex dominating set of fixed size of the graph. The second runs in polynomial time if the graph admits a polynomial number of maximal independent sets. The third one is an O∗(1. 1939 n) time and polynomial (linear) space, which improves over the existing algorithms for exactly solving this problem in general graphs. | - |
| dc.description | Fil: Lin, Min Chih. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina | - |
| dc.description | Fil: Mizrahi, Michel Jonathan. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina | - |
| dc.description | Fil: Szwarcfiter, Jayme L.. Universidade Federal do Rio de Janeiro; Brasil | - |
| dc.format | application/pdf | - |
| dc.format | application/pdf | - |
| dc.language | eng | - |
| dc.publisher | Springer | - |
| dc.relation | info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1007/s00453-015-0095-6 | - |
| dc.relation | info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007%2Fs00453-015-0095-6 | - |
| dc.rights | info:eu-repo/semantics/restrictedAccess | - |
| dc.rights | https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | - |
| dc.source | reponame:CONICET Digital (CONICET) | - |
| dc.source | instname:Consejo Nacional de Investigaciones Científicas y Técnicas | - |
| dc.source | instacron:CONICET | - |
| dc.source.uri | http://hdl.handle.net/11336/60000 | - |
| dc.subject | DOMINATING INDUCED MATCHINGS | - |
| dc.subject | EXACT ALGORITHMS | - |
| dc.subject | GRAPH THEORY | - |
| dc.subject | Matemática Pura | - |
| dc.subject | Matemáticas | - |
| dc.subject | CIENCIAS NATURALES Y EXACTAS | - |
| dc.title | Exact Algorithms for Minimum Weighted Dominating Induced Matching | - |
| dc.type | info:eu-repo/semantics/article | - |
| dc.type | info:eu-repo/semantics/publishedVersion | - |
| dc.type | info:ar-repo/semantics/articulo | - |
| Aparece en las colecciones: | CONICET | |
Ficheros en este ítem:
No hay ficheros asociados a este ítem.