Pages that link to "Item:Q3522944"
From MaRDI portal
The following pages link to A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs (Q3522944):
Displaying 12 items.
- Exact algorithms for dominating set (Q411862) (← links)
- On the max min vertex cover problem (Q499339) (← links)
- The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (Q1751176) (← links)
- An exact algorithm for the minimum dominating clique problem (Q2456374) (← links)
- \textsc{MAX MIN} vertex cover and the size of Betti tables (Q2660135) (← links)
- Iterative construction of the minimum independent dominating sets in hypercube graphs (Q2677356) (← links)
- On Dominating Sets and Independent Sets of Graphs (Q4946835) (← links)
- An Efficient Local Search for the Minimum Independent Dominating Set Problem (Q5140723) (← links)
- On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm (Q5247696) (← links)
- On Independent Sets and Bicliques in Graphs (Q5302053) (← links)
- Targeted Branching for the Maximum Independent Set Problem (Q6159907) (← links)
- Minimal zero forcing sets (Q6644905) (← links)
