• 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

An exact algorithm for MAX CUT in sparse graphs

Thumbnail
Date
2007
Link to item file
http://hal.archives-ouvertes.fr/hal-00116633/en/
Dewey
Recherche opérationnelle
Sujet
Sparse graphs; Exact algorithm; MAX-CUT
Journal issue
Operations Research Letters
Volume
35
Number
3
Publication date
2007
Article pages
403-408
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.orl.2006.04.001
URI
https://basepub.dauphine.fr/handle/123456789/2207
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Kaminski, Marcin
Della Croce, Federico
Paschos, Vangelis
Type
Article accepté pour publication ou publié
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.

  • 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.