• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

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

Thumbnail
Date
1994
Dewey
Principes généraux des mathématiques
Sujet
acyclic subgraphs; compact systems; balanced subgraphs; composition of polyhedra; Polyhedral combinatorics
Journal issue
SIAM Journal on Discrete Mathematics
Volume
7
Number
3
Publication date
05-1994
Article pages
344-358
Publisher
SIAM
DOI
http://dx.doi.org/10.1137/S0895480190182666
URI
https://basepub.dauphine.fr/handle/123456789/3954
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Barahona, Francisco
Mahjoub, Ali Ridha
Type
Article accepté pour publication ou publié
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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.