scientific article; zbMATH DE number 7561362
From MaRDI portal
Publication:5090998
DOI10.4230/LIPIcs.ISAAC.2018.8MaRDI QIDQ5090998
Takeaki Uno, Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Girth and treewidth
- Enumerating minimal dominating sets in chordal bipartite graphs
- Rainbow domination in graphs
- Linear delay enumeration and monadic second-order logic
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
- Tropical dominating sets in vertex-coloured graphs
- The extremal function for complete minors
- Reverse search for enumeration
- A complexity theory for hard enumeration problems
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
- Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph
- Enumeration of Minimal Dominating Sets and Variants
- Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
- Smallest-last ordering and clustering and graph coloring algorithms
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
- New Results on Monotone Dualization and Generating Hypergraph Transversals
- On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets
- On the Enumeration of Minimal Dominating Sets and Related Notions
- Listing All Maximal Cliques in Large Sparse Real-World Graphs
- Algorithm Theory - SWAT 2004
- k-Degenerate Graphs
- Optimal Listing of Cycles and st-Paths in Undirected Graphs
- LATIN 2004: Theoretical Informatics
