论文信息 - On Two-Processor Scheduling and Maximum Matching in Permutation Graphs

On Two-Processor Scheduling and Maximum Matching in Permutation Graphs

Abstract This paper gives an O(n log n) algorithm for computing the two-processor schedule for a set of n tasks, When the precedence constraints are specified by a transitively oriented permutation graph. This implies an O(n log n) algorithm for finding the maximum matching in a permutation graph, improving the O(n log2 n) algorithm of Bauernopper et al. (1995).

Sivaprakasam Sunder | Sarnath Ramnath

[1] Ravi Sethi,et al. Scheduling Graphs on Two Processors , 1976, SIAM J. Comput..

[2] A. Lempel,et al. Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.

[3] Jörg-Rüdiger Sack,et al. Planar Stage Graphs: Characterizations and Applications , 1997, Theor. Comput. Sci..

[4] M. Fujii,et al. Optimal Sequencing of Two Equivalent Processors , 1969 .

[5] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[6] S. S. Ravi,et al. An O(n log n) Lower Bound for Decomposing a Set of Points into Chains , 1989, Inf. Process. Lett..