Pages that link to "Item:Q963425"
From MaRDI portal
The following pages link to Finding a dominating set on bipartite graphs (Q963425):
Displaying 5 items.
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (Q1928496) (← links)
- Exact algorithms for weak Roman domination (Q2413969) (← links)
- Strong geodetic problem on complete multipartite graphs (Q5217086) (← links)
- Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)
- Safe sets and in-dominating sets in digraphs (Q6153473) (← links)
