On-line recognition of interval orders
暂无分享,去创建一个
[1] M. Habib,et al. The Calculation of Invariants for Ordered Sets , 1989 .
[2] Ivan Rival. Combinatorics and ordered sets , 1986 .
[3] Claude Jard,et al. Interval Approximations of Message Causality in Distributed Executions , 1992, STACS.
[4] Rolf H. Möhring,et al. Computationally Tractable Classes of Ordered Sets , 1989 .
[5] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[6] Michel Morvan,et al. A Linear Time and Space Algorithm to Regonize Interval Orders , 1993, Discret. Appl. Math..
[7] Dieter Kratsch,et al. Graph-Theoretic Concepts in Computer Science , 1987, Lecture Notes in Computer Science.
[8] M. Golummc. Algorithmic graph theory and perfect graphs , 1980 .
[9] Jean-Pierre Jouannaud,et al. TAPSOFT'93: Theory and Practice of Software Development , 1993, Lecture Notes in Computer Science.
[10] R. Garbe. A linear time algorithm for recognizing interval orders , 1992 .
[11] Colin J. Fidge,et al. Timestamps in Message-Passing Systems That Preserve the Partial Ordering , 1988 .
[12] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.
[13] Maciej Koutny,et al. Structure of Concurrency , 1991, Theor. Comput. Sci..
[14] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .