
arXiv: 1407.2036
An output-polynomial algorithm for the listing of minimal dominating sets in graphs is a challenging open problem and is known to be equivalent to the well-known Transversal problem which asks for an output-polynomial algorithm for listing the set of minimal hitting sets in hypergraphs. We give a polynomial delay algorithm to list the set of minimal dominating sets in chordal graphs, an important and well-studied graph class where such an algorithm was open for a while.
13 pages, 1 figure, submitted
FOS: Computer and information sciences, Discrete Mathematics (cs.DM), [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], G.2.2, E.1; F.0; G.2.2, 68P05, 68R10, 05C69, 05C85, 05C30, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), E.1, F.0, Computer Science - Discrete Mathematics
FOS: Computer and information sciences, Discrete Mathematics (cs.DM), [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], G.2.2, E.1; F.0; G.2.2, 68P05, 68R10, 05C69, 05C85, 05C30, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), E.1, F.0, Computer Science - Discrete Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 8 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
