• DocumentCode
    1781635
  • Title

    On the star forest polytope

  • Author

    Aoudia, Lamia ; Viet Hung Nguyen ; Mahjoub, A. Ridha ; Aider, Meziane

  • Author_Institution
    Univ. of Sci. & Technol. Houari Boumediene, Algiers, Algeria
  • fYear
    2014
  • fDate
    3-5 Nov. 2014
  • Firstpage
    263
  • Lastpage
    268
  • Abstract
    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) [10] 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).
  • Keywords
    trees (mathematics); vectors; SSFP; incident vector; spanning star forest polytope; vertex-disjoint trees; Clocks; Color; Educational institutions; Electronic mail; Polynomials; Vectors; Vegetation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control, Decision and Information Technologies (CoDIT), 2014 International Conference on
  • Conference_Location
    Metz
  • Type

    conf

  • DOI
    10.1109/CoDIT.2014.6996904
  • Filename
    6996904
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1781635