Conforti, M, Cornuejols, G, Kapoor, A et al. (1 more author) (2002) Even-hole-free graphs part II: Recognition algorithm. Journal of Graph Theory, 40 (4). 238 - 266 . ISSN 0364-9024
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.
Metadata
| Item Type: | Article |
|---|---|
| Authors/Creators: |
|
| 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 |
| Dates: |
|
| Institution: | The University of Leeds |
| Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
| Depositing User: | Symplectic Publications |
| Date Deposited: | 22 Jun 2012 10:43 |
| Last Modified: | 01 Nov 2016 12:03 |
| Published Version: | http://dx.doi.org/10.1002/jgt.10045 |
| Status: | Published |
| Publisher: | Wiley Blackwell |
| Identification Number: | 10.1002/jgt.10045 |
| Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:74360 |
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)