White Rose University Consortium logo
University of Leeds logo University of Sheffield logo York University logo

Even-hole-free graphs part II: Recognition algorithm

Conforti, M, Cornuejols, G, Kapoor, A and Vuskovic, K (2002) Even-hole-free graphs part II: Recognition algorithm. Journal of Graph Theory, 40 (4). 238 - 266 . ISSN 0364-9024

Full text available as:
[img]
Preview
Text
algo-even.pdf
Available under licence : See the attached licence file.

Download (272Kb)

Abstract

We present an algorithm that determines in polytime whether a graph contains an even hole. The algorithm is based on a decomposition theorem for even-hole-free graphs obtained in Part I of this work. We also give a polytime algorithm to find an even hole in a graph when one exists.

Item Type: Article
Copyright, Publisher and Additional Information: © 2002 Wiley Blackwell. This is an author produced version of a paper published in Journal of Graph Theory. Uploaded in accordance with the publisher's self-archiving policy. The definitive version is available at www3.interscience.wiley.com
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 22 Jun 2012 10:43
Last Modified: 09 Jun 2014 16:00
Published Version: http://dx.doi.org/10.1002/jgt.10045
Status: Published
Publisher: Wiley Blackwell
Identification Number: 10.1002/jgt.10045
URI: http://eprints.whiterose.ac.uk/id/eprint/74360

Actions (login required)

View Item View Item