Exact Algorithms for Minimum Weighted Dominating Induced Matching

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

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Lin, M.C., Mizrahi, M.J., Szwarcfiter, J.L.
Formato: JOUR
Materias:
Dominating induced matchings
Exact algorithms
Graph theory
Algorithms
Polynomial approximation
Polynomials
Problem solving
Dominating sets
Edge dominating set
General graph
Induced matchings
Maximal independent set
Polynomial number
Polynomial-time
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_01784617_v77_n3_p642_Lin
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares