Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

31

EOR
2010

favoriteEmaildiscussreport

82views more EOR 2010»

Satisfactory graph partition, variants, and generalizations

13 years 11 months ago

Satisfactory graph partition, variants, and generalizations

Download www.lamsade.dauphine.fr

The Satisfactory Partition problem asks for deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbors in its part as in the other part. This problem was introduced by Gerber and Kobler [EJOR, 125 (2000), 283

Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten

Real-time Traffic

EOR 2010 | Nonempty Parts | Satisfactory Partition | Satisfactory Partition Problem |

claim paper

Related Content

» The satisfactory partition problem

» Complexity and Approximation of Satisfactory Partition Problems

» A general framework for vertex orderings with applications to netlist clustering

» Approximation algorithms via contraction decomposition

» A General Approximation Technique for Constrained Forest Problems

» Computing the Tutte Polynomial in VertexExponential Time

» Provisioning a Virtual Private Network Under the Presence of Noncommunicating Groups

» Approximating the single source unsplittable mincost flow problem

» Sharp Separation and Applications to Exact and Parameterized Algorithms

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	EOR
Authors	Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten

Comments (0)