Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6639
Title: NC Algorithms for Comparability Graphs, Interval Graphs, and Unique Perfect Matchings
Authors: Kozen, Dexter
Vazirani, Umesh V.
Vazirani, Vijay V.
Keywords: computer science
technical report
Issue Date: Dec-1986
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-799
Abstract: Laszlo Lovasz recently posed the following problem: "Is there an NC algorithm for testing if a given graph has a unique perfect matching?" We present such an algorithm for bipartite graphs. We also give NC algorithms for obtaining a transitive orientation of a comparability graph, and an interval representation of an interval graph. These enable us to obtain an NC algorithm for finding a maximum matching in an incomparability graph.
URI: http://hdl.handle.net/1813/6639
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
86-799.pdf1.47 MBAdobe PDFView/Open
86-799.ps301.1 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us