College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||NC Algorithms for Comparability Graphs, Interval Graphs, and Unique Perfect Matchings|
|Authors: ||Kozen, Dexter|
Vazirani, Umesh V.
Vazirani, Vijay V.
|Keywords: ||computer science|
|Issue Date: ||Dec-1986|
|Publisher: ||Cornell University|
|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.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.