Sciweavers

604 search results - page 2 / 121
» On the Complexity of the Maximum Cut Problem
Sort
View
JCO
2011
85views more  JCO 2011»
12 years 8 months ago
A Branch and Cut solver for the maximum stable set problem
Steffen Rebennack, Marcus Oswald, Dirk Oliver Thei...
WG
2007
Springer
13 years 11 months ago
On Finding Graph Clusterings with Maximum Modularity
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
DISOPT
2008
89views more  DISOPT 2008»
13 years 5 months ago
Complexity of the min-max (regret) versions of min cut problems
This paper investigates the complexity of the min-max and min-max regret versions of the min s-t cut and min cut problems. Even if the underlying problems are closely related and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...