Searching in 2-dimensional partial orders
- 31 March 1987
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 8 (1) , 95-105
- https://doi.org/10.1016/0196-6774(87)90029-0
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Every poset has a central elementJournal of Combinatorial Theory, Series A, 1985
- Searching ordered structuresJournal of Algorithms, 1985
- Single Machine Scheduling with Precedence Constraints of Dimension 2Mathematics of Operations Research, 1984
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is ConnectedSIAM Journal on Computing, 1983
- The Recognition of Series Parallel DigraphsSIAM Journal on Computing, 1982
- Counting antichains in finite partially ordered setsDiscrete Mathematics, 1981
- Implicit data structures for fast search and updateJournal of Computer and System Sciences, 1980
- Dynamic Programming Solution of Sequencing Problems with Precedence ConstraintsOperations Research, 1978
- Partial orders of dimension 2Networks, 1972
- Partially Ordered SetsAmerican Journal of Mathematics, 1941