An lower bound for decomposing a set of points into chains
Authors:
- Peter A. BloniarzPBPeter A. Bloniarz
- S.S. RaviSRS.S. Ravi
- 1 June 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 31 (6) , 319-322
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A variant of Ben-or's lower bound for algebraic decision treesInformation Processing Letters, 1988
- Obtaining lower bounds using artificial componentsInformation Processing Letters, 1987
- The Ultimate Planar Convex Hull Algorithm?SIAM Journal on Computing, 1986
- Decomposing a set of points into chains, with applications to permutation and circle graphsInformation Processing Letters, 1985