|
 
|
[PIC11] Minimum Transversals for the Maximum Stable Set Problem in Weighted Bipartite Graphs
Conférences Internationales sans actes : DIMAP Workshop 2011, Warwick, England,Mots clés: transversal, bipartite graph, stable set, matching
Résumé:
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.
Equipe:
oc
BibTeX
| @conference { | |||
| PIC11, | |||
| title | = | "{Minimum Transversals for the Maximum Stable Set Problem in Weighted Bipartite Graphs}", | |
| author | = | " C. Picouleau ", | |
| year | = | 2011, | |
| } | |||
