Pages that link to "Item:Q1183585"
From MaRDI portal
The following pages link to Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs (Q1183585):
Displaying 6 items.
- On-line algorithms for the dominating set problem (Q290186) (← links)
- Finding minimum dominating cycles in permutation graphs (Q1060966) (← links)
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569) (← links)
- The minimum weight dominating set problem for permutation graphs is in NC (Q1898177) (← links)
- An Exact Algorithm for the Minimum Dominating Clique Problem (Q3499731) (← links)
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs (Q5941496) (← links)