The facets of the polytope of modules of a graph

Authors:
Yann Kieffer
Affiliations:
Laboratoire Leibniz, 46, Avenue Félix Viallet, 38031 Grenoble Cedex, France
Venue:
Operations Research Letters
Year:
2003

Citing 2
Cited 0

Linear-time modular decomposition and efficient transitive orientation of comparability graphs

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A New Linear Algorithm for Modular Decomposition

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

After recalling the main facts of the well-studied modular decomposition theory for graphs, we give the full description of the facets of the polytope of modules of a graph. Features of interest are that the constraints associated to facets are not associated to combinatorial objects, and depend only on the modular decomposition tree of the graph. Because of the recursive structure of that tree, we describe the facet constraints as the set of outputs of a non-deterministic algorithm.