Show simple item record

dc.contributor.authorKozen, Dexteren_US
dc.contributor.authorVazirani, Umesh V.en_US
dc.contributor.authorVazirani, Vijay V.en_US
dc.date.accessioned2007-04-23T17:17:23Z
dc.date.available2007-04-23T17:17:23Z
dc.date.issued1986-12en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-799en_US
dc.identifier.urihttps://hdl.handle.net/1813/6639
dc.description.abstractLaszlo 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.en_US
dc.format.extent1508365 bytes
dc.format.extent308324 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleNC Algorithms for Comparability Graphs, Interval Graphs, and Unique Perfect Matchingsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics