On the star forest polytope
Aoudia, Lamia; Nguyen, Viet Hung; Mahjoub, Ali Ridha; Aider, Meziane (2014-11), On the star forest polytope, in Kacem, Imed; Laroche, Pierre; Róka, Zsuzsanna, 2014 International Conference on Control, Decision and Information Technologies (CoDIT). Proceedings, IEEE : Piscataway, NJ, p. 263-268. 10.1109/CoDIT.2014.6996904
TypeCommunication / Conférence
Conference title2014 International Conference on Control, Decision and Information Technologies (CoDIT)
Book title2014 International Conference on Control, Decision and Information Technologies (CoDIT). Proceedings
Book authorKacem, Imed; Laroche, Pierre; Róka, Zsuzsanna
Number of pages794
MetadataShow full item record
Nguyen, Viet Hung
Laboratoire d'Informatique de Paris 6 [LIP6]
Mahjoub, Ali Ridha
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is a spanning subgraph of G that is also star forest. The spanning star forest problem (SSFP for short)  is to find maximum size spanning star forest of given graph. Let define some graph G = (V;E), to every star forest we associate a vector xF . xF (e) = 1 if e ∈ F and xF (e) = 0 otherwise. xF is the incident vector of spanning star forest F. The convex hull of all spanning star forest incident vectors is called a spanning star forest polytope, denoted SFP(G). In this paper we are mainly interested on complete characterization of SFP(G).
Subjects / Keywordsvectors; trees (mathematics); polytope; graph; star forest
Showing items related by title and author.