Abstract
Most papers dealing with partial orders assume that the input is given either in transitively closed or transitively reduced form. In this paper, we show that it is possible to solve some problems on partial orders in less time than it takes to perform transitive closure or reduction for general graphs. In particular, we present efficient algorithms for recognizing two dimensional partial orders and N-free partial orders when no assumptions are made about the form of the input.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. A.Baker, P. C.Fishburn, and F. S.Roberts (1971) Partial orders of dimension 2, Networks 2, 11–28.
A. Belfer and M. C. Golumbic (1991) Counting endpoint-sequences for interval orders and interval graphs, Discrete Math, to appear.
J. L. Bentley, D. Haken, and J. B. Saxe (1980) A general method for solving divide-and-conquer recurrences, SIGACT News, 36–44.
D. Coppersmith and S. Winograd (1987) Matrix multiplication via arithmetic progressions, Proceedings of the 19th Annual Symposium on the Theory of Computation, 1–6.
B.Dushnik and E.Miller (1941) Partially ordered sets, American Journal of Mathematics 63, 600–610.
M. C.Golumbic (1980) Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York.
M.Habib and R. H.Möhring (1987) On some complexity properties of N-free posets and posets with bounded decomposition diameter, Discrete Mathematics 63, 157–182.
T. H.Ma and J. P.Spinrad (1991) Cycle-free partial orders and chordal comparability graphs, Order 8, 49–61.
R. H.Möhring (1989) Computationally tractable classes of ordered sets, in Algorithms and Order, ed. I.Rival, Kluwer, Dordrecht, 105–194.
J. H.Muller and J.Spinrad (1989) Incremental modular decomposition, Journal of the ACM 36, 1–19.
A.Pnueli, A.Lempel, and S.Even (1971) Transitive orientation graphs and identification of permutation graphs, Canadian Journal of Mathematics 23, 160–175.
C. H.Papadimitriou and M.Yannakakis (1979) Scheduling interval-ordered tasks, SIAM Journal on Computing 8, 405–409.
J.Spinrad and J.Valdes (1983) Recognition and isomorphism of two dimensional partial orders, 10th Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science 154, Springer, Berlin, 676–686.
J.Spinrad (1987) On comparability and permutation graphs, SIAM Journal on Computing 14, 658–670.
J. Spinrad (1991) P 4-trees and the substitution decomposition, Discrete Applied Mathematics, to appear.
G.Steiner (1987) Single machine scheduling with precedence constraints of dimension 2, Math. Op. Research 9, 248–259.
G.Steiner (1987) Searching in two dimensional partial orders, Journal Algorithms 8, 95–105.
M. M.Syslo (1982) A labeling algorithm to recognize a line digraph and output its root graph, Information Processing Letters 15, 241–260.
J.Valdes, R. E.Tarjan, and E. L.Lawler (1978) The recognition of series-parallel digraphs, SIAM Journal on Computing 11, 298–314.
M.Yannakakis (1982) The complexity of the partial order dimension problem, SIAM J. Disc. Meth. 3, 351–358.
Author information
Authors and Affiliations
Additional information
Communicated by R. Möhring
This work was supported by National Science Foundation Grant DCR-8604577 and the Vanderbilt University Research Council.
Rights and permissions
About this article
Cite this article
Ma, TH., Spinrad, J. Transitive closure for restricted classes of partial orders. Order 8, 175–183 (1991). https://doi.org/10.1007/BF00383402
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00383402