Enumerating minimal dominating sets in chordal bipartite graphs
type: Item
instance of: scholarly article
title: Enumerating minimal dominating sets in chordal bipartite graphs
zbMATH Open document ID: 1326.05105
author: Petr A. Golovach
author: Pinar Heggernes
author: Dieter Kratsch
author: Yngve Villanger
author: Mamadou Moustapha Kanté
published in: Discrete Applied Mathematics
publication date: 2015-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6519402
zbMATH Keywords: minimal dominating set
zbMATH Keywords: enumeration
zbMATH Keywords: output polynomial algorithm
MaRDI profile type: Publication
full work available at URL: j.dam.2014.12.010
OpenAlex ID: W2084621880
cites work: Reverse search for enumeration
cites work: Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
cites work: LATIN 2004: Theoretical Informatics
cites work: Dual subimplicants of positive Boolean functions
cites work: Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
cites work: Graph Classes: A Survey
cites work: Linear delay enumeration and monadic second-order logic
cites work: Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
cites work: Exact transversal hypergraphs and application to Boolean \(\mu\)-functions
cites work: Identifying the Minimal Transversals of a Hypergraph and Related Problems
cites work: Q4708957
cites work: New Results on Monotone Dualization and Generating Hypergraph Transversals
cites work: Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms
cites work: Perfect Elimination and Chordal Bipartite Graphs
cites work: Q4368728
cites work: On generating all maximal independent sets
cites work: On the Enumeration of Minimal Dominating Sets and Related Notions
cites work: On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets
cites work: On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs
cites work: Generating all vertices of a polyhedron is hard
cites work: Generating cut conjunctions in graphs and related problems
cites work: On enumerating minimal dicuts and strongly connected subgraphs
cites work: Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
cites work: The Maximum Latency and Identification of Positive Boolean Functions
cites work: A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions
cites work: NP-completeness: A retrospective
cites work: On enumerating all minimal solutions of feedback problems
cites work: Enumeration of the Elementary Circuits of a Directed Graph
cites work: An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
DOI: 10.1016/J.DAM.2014.12.010
description: scientific article; zbMATH DE number 6519402