Pages that link to "Item:Q635737"
From MaRDI portal
The following pages link to An exact algorithm for connected red-blue dominating set (Q635737):
Displaying 10 items.
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Exact exponential algorithms to find tropical connected sets of minimum size (Q527400) (← links)
- On the parameterized complexity of dynamic problems (Q896122) (← links)
- An improved exact algorithm for minimum dominating set in chordal graphs (Q2059888) (← links)
- Linear algorithms for red and blue domination in convex bipartite graphs (Q2115838) (← links)
- Bounds for the connected domination number of maximal outerplanar graphs (Q2166232) (← links)
- Enumeration of minimal connected dominating sets for chordal graphs (Q2174551) (← links)
- Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size (Q2946015) (← links)
- Below All Subsets for Minimal Connected Dominating Set (Q4683902) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
