We present an O(n5) algorithm that computes a maximum stable set of any perfect graph with no balanced skew-partition. We present O(n7) time algorithm that colors them
In this thesis we study algorithmic aspects of two graph partitioning problems -- graph coloring and...
A 2-join is an edge cutset that naturally appears in decomposition of several classes of graphs clos...
Computing the chromatic number and finding an optimal coloring of a perfect graph can be done effici...
International audienceWe present an $O(n^5)$ algorithm that computes a maximum stable set of any per...
We present an O(n5) algorithm that computes a maximum stable set of any perfect graph with no balanc...
The final publication is available at Elsevier via https://doi.org/10.1016/j.jctb.2016.09.006. © 201...
We consider the class of Berge graphs that do not contain an induced cycle of length four. We presen...
We consider the class of Berge graphs that do not contain a chordless cycle of length $4$. We presen...
URL des Cahiers : https://halshs.archives-ouvertes.fr/CAHIERS-MSE Voir aussi l'article basé sur ce d...
The goal of this these is to use graph's decompositions to solve algorithmic problems on graphs. We ...
AbstractA 2-join is an edge cutset that naturally appears in decomposition of several classes of gra...
AbstractA hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has ...
In this thesis we study algorithmic aspects of two graph partitioning problems -- graph coloring and...
A 2-join is an edge cutset that naturally appears in decomposition of several classes of graphs clos...
Computing the chromatic number and finding an optimal coloring of a perfect graph can be done effici...
International audienceWe present an $O(n^5)$ algorithm that computes a maximum stable set of any per...
We present an O(n5) algorithm that computes a maximum stable set of any perfect graph with no balanc...
The final publication is available at Elsevier via https://doi.org/10.1016/j.jctb.2016.09.006. © 201...
We consider the class of Berge graphs that do not contain an induced cycle of length four. We presen...
We consider the class of Berge graphs that do not contain a chordless cycle of length $4$. We presen...
URL des Cahiers : https://halshs.archives-ouvertes.fr/CAHIERS-MSE Voir aussi l'article basé sur ce d...
The goal of this these is to use graph's decompositions to solve algorithmic problems on graphs. We ...
AbstractA 2-join is an edge cutset that naturally appears in decomposition of several classes of gra...
AbstractA hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has ...
In this thesis we study algorithmic aspects of two graph partitioning problems -- graph coloring and...
A 2-join is an edge cutset that naturally appears in decomposition of several classes of graphs clos...
Computing the chromatic number and finding an optimal coloring of a perfect graph can be done effici...
DOI
Add to ORKG