Minimum Transversals for the Maximum Stable Set Problem in Weighted Bipartite Graphs

Christophe Picouleau (1)

1 CEDRIC - Centre d'études et de recherche en informatique et communications

We study the maximum stable set d-transversal problem for the vertex-weighted graphs.We will give some results (structure and algorithm) when G is a tree. We will also give some results concerning the co-bipartite graphs and split graphs.

Mots clés: bipartite graph; stable set; matching

Mots clés: transversal; graphe biparti; ensemble stable; correspondance

Domaines: Informatique [cs]; Complexité [cs.CC]

Christophe Picouleau. Minimum Transversals for the Maximum Stable Set Problem in Weighted Bipartite Graphs. DIMAP Workshop 2011, Feb 2011, Warwick, United Kingdom. ⟨hal-01125848⟩