Pages that link to "Item:Q5757876"
From MaRDI portal
The following pages link to Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes (Q5757876):
Displayed 5 items.
- On the max min vertex cover problem (Q499339) (← links)
- Finding a dominating set on bipartite graphs (Q963425) (← links)
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (Q1928496) (← 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)