Cookies?
Library Header Image
LSE Research Online LSE Library Services

Restricted b-matchings in degree-bounded graphs

Bérczi, Kristóf and Végh, László A. (2010) Restricted b-matchings in degree-bounded graphs. In: The 14th Conference on Integer Programming & Combinatorial Optimization (IPCO XIV), 9th-11th June 2010, Lausanne, Switzerland.

Full text not available from this repository.

Abstract

We present a min-max formula and a polynomial time algorithm for a slight generalization of the following problem: in a simple undirected graph in which the degree of each node is at most t + 1, find a maximum t-matching containing no member of a list of forbidden K t,t and K t + 1 subgraphs. An analogous problem for bipartite graphs without degree bounds was solved by Makai [15], while the special case of finding a maximum square-free 2-matching in a subcubic graph was solved in [1].

Item Type: Conference or Workshop Item (Paper)
Official URL: http://ipco.epfl.ch/index.html#start
Additional Information: © 2010 The Authors
Library of Congress subject classification: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Sets: Departments > Management
Rights: http://www.lse.ac.uk/library/usingTheLibrary/academicSupport/OA/depositYourResearch.aspx
Identification Number: Published item via DOI
Date Deposited: 11 Oct 2012 12:36
URL: http://eprints.lse.ac.uk/45896/

Actions (login required)

Record administration - authorised staff only Record administration - authorised staff only