The facets of the polytope of modules of a graph

被引：0
|
作者：
Kieffer, Y [1 ]
机构：
[1] Lab Leibniz, F-38031 Grenoble, France
来源：
OPERATIONS RESEARCH LETTERS | 2003年 / 31卷 / 06期
关键词：
polyhedral description; facets; modules; homogeneous sets; modular decomposition;
D O I：
10.1016/S0167-6377(03)00049-X
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
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. (C) 2003 Elsevier B.V. All rights reserved.
引用
下载
收藏
页码：435 / 441
页数：7
相关论文
共 50 条
  • [1] Facets of the Graph Coloring Polytope
    Pablo Coll
    Javier Marenco
    Isabel Méndez Díaz
    Paula Zabala
    Annals of Operations Research, 2002, 116 : 79 - 90
  • [2] Facets of the graph coloring polytope
    Coll, P
    Marenco, J
    Díaz, IM
    Zabala, P
    ANNALS OF OPERATIONS RESEARCH, 2002, 116 (1-4) : 79 - 90
  • [3] Facets of the directed acyclic graph layering polytope
    Healy, P
    Nikolov, NS
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2002, 2573 : 246 - 257
  • [4] Generating facets for the cut polytope of a graph by triangular elimination
    Avis, David
    Imai, Hiroshi
    Ito, Tsuyoshi
    MATHEMATICAL PROGRAMMING, 2008, 112 (02) : 303 - 325
  • [5] Generating facets for the cut polytope of a graph by triangular elimination
    David Avis
    Hiroshi Imai
    Tsuyoshi Ito
    Mathematical Programming, 2008, 112 : 303 - 325
  • [6] b-tree facets for the simple graph partitioning polytope
    Sorensen, MM
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2004, 8 (02) : 151 - 170
  • [7] b-Tree Facets for the Simple Graph Partitioning Polytope
    Michael M. Sørensen
    Journal of Combinatorial Optimization, 2004, 8 : 151 - 170
  • [8] The circuit polytope: Facets
    Bauer, P
    MATHEMATICS OF OPERATIONS RESEARCH, 1997, 22 (01) : 110 - 145
  • [9] FACETS OF THE SCHEDULING POLYTOPE
    KRAUSE, W
    DEWESS, G
    LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1990, 143 : 478 - 485
  • [10] FACETS OF KNAPSACK POLYTOPE
    BALAS, E
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1974, 21 (01): : A11 - A11
12345