Pages that link to "Item:Q2827808"
From MaRDI portal
The following pages link to A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs (Q2827808):
Displaying 11 items.
- 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)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- Invited talks (Q2692717) (← links)
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs (Q5090462) (← links)
- (Q5090998) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6547209) (← links)
- An approximation algorithm for \(K\)-best enumeration of minimal connected edge dominating sets with cardinality constraints (Q6562874) (← links)
- On computing large temporal (unilateral) connected components (Q6564621) (← links)
