• 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

On the maximum independent set problem in subclasses of subcubic graphs

Ries, Bernard; Monnot, Jérôme; Lozin, Vadim (2015), On the maximum independent set problem in subclasses of subcubic graphs, Journal of Discrete Algorithms, 31, p. 104-112. 10.1016/j.jda.2014.08.005

Type
Article accepté pour publication ou publié
Date
2015
Journal name
Journal of Discrete Algorithms
Volume
31
Publisher
Elsevier
Pages
104-112
Publication identifier
10.1016/j.jda.2014.08.005
Metadata
Show full item record
Author(s)
Ries, Bernard
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Monnot, Jérôme cc
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Lozin, Vadim
Warwick Mathematics Institute and DIMAP
Abstract (EN)
It is known that the maximum independent set problem is NP-complete for subcubic graphs, i.e. graphs of vertex degree at most 3. Moreover, the problem is NP-complete for 3-regular Hamiltonian graphs and for H -free subcubic graphs whenever H contains a connected component which is not a tree with at most 3 leaves. We show that if every connected component of H is a tree with at most 3 leaves and at most 7 vertices, then the problem can be solved for H -free subcubic graphs in polynomial time. We also strengthen the NP-completeness of the problem on 3-regular Hamiltonian graphs by showing that the problem is APX-complete in this class
Subjects / Keywords
APX-completeness; Subcubic graph; Polynomial-time algorithm; Independent set

Related items

Showing items related by title and author.

  • Thumbnail
    On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs 
    Lozin, Vadim; Monnot, Jérôme; Ries, Bernard (2013) Communication / Conférence
  • Thumbnail
    Maximum Independent Sets in Subcubic Graphs: New Results 
    Harutyunyan, Ararat; Lampis, Michael; Lozin, Vadim; Monnot, Jérôme (2019) Communication / Conférence
  • Thumbnail
    Maximum Independent Sets in Subcubic Graphs: New Results 
    Harutyunyan, Ararat; Lampis, Michael; Lozin, Vadim; Monnot, Jérôme (2019) Communication / Conférence
  • Thumbnail
    Maximum independent sets in subcubic graphs: New results 
    Harutyunyan, Ararat; Lampis, Michael; Lozin, V.; Monnot, Jérôme (2020) Article accepté pour publication ou publié
  • Thumbnail
    On the complexity of the selective graph coloring problem in some special classes of graphs 
    Ries, Bernard; Pop, Petrica; Monnot, Jérôme; Demange, Marc (2014) 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