A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
- 1 January 1987
- journal article
- Published by Springer Nature in Order
- Vol. 3 (4) , 359-367
- https://doi.org/10.1007/bf00340778
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Algorithmic Approaches to Setup MinimizationSIAM Journal on Computing, 1985
- Greedy linear extensions to minimize jumpsDiscrete Applied Mathematics, 1985
- Minimizing setups in ordered sets of fixed widthOrder, 1985
- Jump number of dags having Dilworth number 2Discrete Applied Mathematics, 1984
- Minimizing Setups for Ordered Sets: A Linear Algebraic ApproachSIAM Journal on Algebraic Discrete Methods, 1983
- Optimal linear extensions by interchanging chainsProceedings of the American Mathematical Society, 1983
- Minimizing setups for cycle-free ordered setsProceedings of the American Mathematical Society, 1982
- The Jump Number of Dags and Posets: An IntroductionPublished by Elsevier ,1980
- Nombre de sauts et graphes série-parallèlesRAIRO. Informatique théorique, 1979
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972