• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Composition of graphs and polyhedra I : Balanced induced subgraphs and acyclic subgraphs

Barahona, Francisco; Mahjoub, Ali Ridha (1994), Composition of graphs and polyhedra I : Balanced induced subgraphs and acyclic subgraphs, SIAM Journal on Discrete Mathematics, 7, 3, p. 344-358. http://dx.doi.org/10.1137/S0895480190182666

Type
Article accepté pour publication ou publié
Date
1994
Journal name
SIAM Journal on Discrete Mathematics
Volume
7
Number
3
Publisher
SIAM
Pages
344-358
Publication identifier
http://dx.doi.org/10.1137/S0895480190182666
Metadata
Show full item record
Author(s)
Barahona, Francisco
Mahjoub, Ali Ridha
Abstract (EN)
Let $P( G )$ be the balanced induced subgraph polytope of $G$. If $G$ has a two-node cutset, then $G$ decomposes into $G_1 $ and $G_2$. It is shown that $P( G )$ can be obtained as a projection of a polytope defined by a system of inequalities that decomposes into two pieces associated with $G_1 $ and $G_2$. The problem max $cx,x \in P( G )$ is decomposed in the same way. This is applied to series-parallel graphs to show that, in this case, $P( G )$ is a projection of a polytope defined by a system with $O( n )$ inequalities and $O( n )$ variables, where $n$ is the number of nodes in $G$. Also for this class of graphs, an algorithm is given that finds a maximum weighted balanced induced subgraph in $O( n\log n )$ time. This approach is also used to obtain composition of facets of $P( G )$. Analogous results are presented for acyclic induced subgraphs.
Subjects / Keywords
acyclic subgraphs; compact systems; balanced subgraphs; composition of polyhedra; Polyhedral combinatorics

Related items

Showing items related by title and author.

  • Thumbnail
    Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs 
    Barahona, Francisco; Fonlupt, Jean; Mahjoub, Ali Ridha (1994) Article accepté pour publication ou publié
  • Thumbnail
    Composition of graphs and polyhedra III : Graphs with No $W_4$ minor 
    Barahona, Francisco; Mahjoub, Ali Ridha (1994) Article accepté pour publication ou publié
  • Thumbnail
    Composition of graphs and polyhedra II : Stable Sets 
    Barahona, Francisco; Mahjoub, Ali Ridha (1994) Article accepté pour publication ou publié
  • Thumbnail
    Compositions of Graphs and the Triangle-Free Subgraph Polytope 
    Bendali, Fatiha; Mailfert, Jean; Mahjoub, Ali Ridha (2002) Article accepté pour publication ou publié
  • Thumbnail
    On two connected subgraph polytopes 
    Mahjoub, Ali Ridha; Barahona, Francisco (1995) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo