Efficient labelling algorithms for the maximum noncrossing matching problem
- 1 November 1993
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 47 (2) , 175-179
- https://doi.org/10.1016/0166-218x(93)90090-b
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Bounded ordered dictionaries in O(log log N) time and O(n) spaceInformation Processing Letters, 1990
- Priority Search TreesSIAM Journal on Computing, 1985
- An optimal algorithm for the maximum alignment of terminalsInformation Processing Letters, 1985
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977
- On computing the length of longest increasing subsequencesDiscrete Mathematics, 1975