Volume 42, Number 4, October-December 2008ALIO/EURO V Conference on Combinatorial Optimization
|Page(s)||485 - 500|
|Published online||04 April 2009|
Comparing Imperfection Ratio and Imperfection Index for Graph Classes
University of Warwick, Centre for Discrete Mathematics and its Applications (DIMAP),
Coventry CV4 7AL, UK; Arie.Koster@wbs.ac.uk - Supported by the DFG research group
“Algorithms, Structure, Randomness” (Grant number GR 883/9-3, GR
2 Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik, Institut für Mathematische Optimierung (IMO), Universitätsplatz 2, 39106 Magdeburg, Germany; email@example.com
Accepted: 9 January 2008
Perfect graphs constitute a well-studied graph class with a rich structure, reflected by many characterizations with respect to different concepts. Perfect graphs are, for instance, precisely those graphs G where the stable set polytope STAB(G) coincides with the fractional stable set polytope QSTAB(G). For all imperfect graphs G it holds that STAB(G) ⊂ QSTAB(G). It is, therefore, natural to use the difference between the two polytopes in order to decide how far an imperfect graph is away from being perfect. We discuss three different concepts, involving the facet set of STAB(G), the disjunctive index of QSTAB(G), and the dilation ratio of the two polytopes. Including only certain types of facets for STAB(G), we obtain graphs that are in some sense close to perfect graphs, for example minimally imperfect graphs, and certain other classes of so-called rank-perfect graphs. The imperfection ratio has been introduced by Gerke and McDiarmid  as the dilation ratio of STAB(G) and QSTAB(G), whereas Aguilera et al.  suggest to take the disjunctive index of QSTAB(G) as the imperfection index of G. For both invariants there exist no general upper bounds, but there are bounds known for the imperfection ratio of several graph classes [7,12]. Outgoing from a graph-theoretical interpretation of the imperfection index, we prove that there exists no upper bound on the imperfection index for those graph classes with a known bounded imperfection ratio. Comparing the two invariants on those classes, it seems that the imperfection index measures imperfection much more roughly than the imperfection ratio; we, therefore, discuss possible directions for refinements.
Mathematics Subject Classification: 05C17 / 90C57
Key words: Perfect graphs / imperfection ratio / imperfection index.
© EDP Sciences, ROADEF, SMAI, 2008
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.