• 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 - No thumbnail

An exact algorithm for MAX CUT in sparse graphs

Kaminski, Marcin; Della Croce, Federico; Paschos, Vangelis (2007), An exact algorithm for MAX CUT in sparse graphs, Operations Research Letters, 35, 3, p. 403-408. http://dx.doi.org/10.1016/j.orl.2006.04.001

Type
Article accepté pour publication ou publié
External document link
http://hal.archives-ouvertes.fr/hal-00116633/en/
Date
2007
Journal name
Operations Research Letters
Volume
35
Number
3
Publisher
Elsevier
Pages
403-408
Publication identifier
http://dx.doi.org/10.1016/j.orl.2006.04.001
Metadata
Show full item record
Author(s)
Kaminski, Marcin
Della Croce, Federico
Paschos, Vangelis
Abstract (EN)
We study exact algorithms for the MAX-CUT problem. Introducing a new technique, we present an algorithmic scheme that computes a maximum cut in graphs with bounded maximum degree. Our algorithm runs in time O*(2(1-(2/Δ))n). We also describe a MAX-CUT algorithm for general graphs. Its time complexity is O*(2mn/(m+n)). Both algorithms use polynomial space.
Subjects / Keywords
Sparse graphs; Exact algorithm; MAX-CUT

Related items

Showing items related by title and author.

  • Thumbnail
    An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs 
    Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis (2008) Communication / Conférence
  • Thumbnail
    Worst-case complexity of exact algorithms for NP-hard problems 
    Della Croce, Federico; Escoffier, Bruno; Kaminski, Marcin; Paschos, Vangelis (2008) Chapitre d'ouvrage
  • Thumbnail
    Exact Algorithms for Dominating Clique Problems 
    Bourgeois, Nicolas; Della Croce, Federico; Escoffier, Bruno; Paschos, Vangelis (2009) Communication / Conférence
  • Thumbnail
    Efficient Algorithms for the max k -vertex cover Problem 
    Della Croce, Federico; Paschos, Vangelis (2012) Communication / Conférence
  • Thumbnail
    Efficient algorithms for the Max k-Vertex Cover problem 
    Paschos, Vangelis; Della Croce, Federico (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