UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Detecting an Odd Hole

dc.contributor.authorChudnovsky, Maria
dc.contributor.authorScott, Alex
dc.contributor.authorSeymour, Paul
dc.contributor.authorSpirkl, Sophie
dc.date.accessioned2022-08-12T01:08:55Z
dc.date.available2022-08-12T01:08:55Z
dc.date.issued2020-02
dc.description© Maria Chudnovsky, Alex Scott, Paul Seymour, Sophie Spirkl | ACM 2020. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in Journal of the ACM, https://doi.org/10.1145/3375720en
dc.description.abstractWe give a polynomial-time algorithm to test whether a graph contains an induced cycle with length more than three and odd.en
dc.description.sponsorshipThis material is based upon work supported in part by the U. S. Army Research Office under Grant No. W911NF-16-1-0404 (Chudnovsky). This material is based upon work supported by the Air Force Office of Scientific Research (AFOSR) under Grant No. A9550-19-1-0187 (Seymour) and the National Science Foundation under Grant No. DMS-1763817 (Chudnovsky), Grant No. DMS-1800053 (Seymour), and Grant No. DMS-1802201 (Spirkl). Alex Scott is supported by a Leverhulme Trust Research Fellowshipen
dc.identifier.urihttps://doi.org/10.1145/3375720
dc.identifier.urihttp://hdl.handle.net/10012/18527
dc.language.isoenen
dc.publisherAssociation for Computing Machineryen
dc.subjectodd holesen
dc.subjectperfect graphsen
dc.subjectrecognition algorithmen
dc.titleDetecting an Odd Holeen
dc.typeArticleen
dcterms.bibliographicCitationChudnovsky, M., Scott, A., Seymour, P., & Spirkl, S. (2020). Detecting an Odd Hole. Journal of the ACM, 67(1), 5:1-5:12. https://doi.org/10.1145/3375720en
uws.contributor.affiliation1Faculty of Mathematicsen
uws.contributor.affiliation2Combinatorics and Optimizationen
uws.peerReviewStatusRevieweden
uws.scholarLevelFacultyen
uws.typeOfResourceTexten

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
1903.00208.pdf
Size:
203.5 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
4.47 KB
Format:
Item-specific license agreed upon to submission
Description: