a reduction algorithm for the weighted stable set problem in claw-free graphs：无爪图加权稳定集问题的一个约简算法.pdfVIP

Discrete Applied Mathematics 165 (2014) 245–262 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: /locate/dam A reduction algorithm for the weighted stable set problem in claw-free graphs Paolo Nobili a,∗, Antonio Sassano b a Dipartimento di Ingegneria dell’Innovazione, Università del Salento, Lecce, Italy b Dipartimento di Ingegneria Informatica, Automatica e Gestionale ‘‘Antonio Ruberti’’, Università di Roma ‘‘La Sapienza’’, Roma, Italy a r t i c l e i n f o a b s t r a c t Article history: In this article the Lovász–Plummer clique reduction is extended to the weighted case and Received 28 November 2011 used to find a maximum weight stable set in a claw-free graph G with n nodes in O(n2 (n2 + Received in revised form 30 July 2013 L(n))) time, where L(n) is the complexity of finding a maximum weight augmenting path Accepted 7 October 2013 in a line graph H with n nodes. The best algorithm known to date to solve the latter problem Available online 1 November 2013 is Gabow’s maximum weight matching algorithm (applied to the root graph of H ) which has a complexity of O(n2 log n). It follows that our algorithm can produce a maximum weight Keywords: 4 stable set in a claw-free graph in O(n log n) time. Claw-free graphs Stable set © 2013 Elsevier B.V. All rights reserved. Clique reduction Matching Augme