Pages that link to "Item:Q2346555"
From MaRDI portal
The following pages link to Approximation algorithms for clique transversals on some graph classes (Q2346555):
Displaying 8 items.
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- Algorithms for finding clique-transversals of graphs (Q940841) (← links)
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs (Q1944214) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal (Q2059196) (← links)
- The algorithmic complexity of the minus clique-transversal problem (Q2383654) (← links)
- LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs (Q2921429) (← links)
- Optimal‐size clique transversals in chordal graphs (Q4646950) (← links)