Pages that link to "Item:Q896653"
From MaRDI portal
The following pages link to Enumerating minimal dominating sets in chordal bipartite graphs (Q896653):
Displaying 13 items.
- Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
- On the dualization in distributive lattices and related problems (Q2030249) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- Linear algorithms for red and blue domination in convex bipartite graphs (Q2115838) (← links)
- On strictly chordality-\(k\) graphs (Q2181248) (← links)
- Invited talks (Q2692717) (← links)
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs (Q2827808) (← links)
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs (Q5090462) (← links)
- (Q5090998) (← links)
- Enumeration of Maximal Irredundant Sets for Claw-Free Graphs (Q5283376) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6547209) (← links)
