Pages that link to "Item:Q410660"
From MaRDI portal
The following pages link to Weighted maximum-clique transversal sets of graphs (Q410660):
Displaying 8 items.
- Maximum \(k\)-covering of weighted transitive graphs with applications (Q1207331) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484) (← links)
- Minimum \(d\)-transversals of maximum-weight stable sets in trees (Q2857332) (← links)
- (Q3109939) (← links)
- Maximum weighted independent sets on transitive graphs and applications (Q4225377) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)