Sorting jordan sequences in linear time using level-linked search trees

Information and Control

Volumn 68, Issue 1-3, 1986, Pages 170-184

  Hoffmann, Kurt ^a   Mehlhorn, Kurt ^a   Rosenstiehl, Pierre ^b   Tarjan, Robert E ^c  

^a SAARLAND UNIVERSITY   (Germany)

^b Centre de Mathematique Sociale   (France)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING - SORTING; MATHEMATICAL TECHNIQUES - TREES;

JORDAN SEQUENCES; LEVEL-LINKED SEARCH TREES; LINEAR TIME;

COMPUTER PROGRAMMING;

EID: 0022436559     PISSN: 00199958     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0019-9958(86)80033-X     Document Type: Article

References (20)

1. Organization and maintenance of large ordered indexes
2. Testing for the consecutive ones property, interval graphs, and graph planarity using P-Q tree algorithms
3. Design and analysis of a data structure for representing sorted lists
4. Problem P35
5. A depth-first search characterization of planarity
6. How good is the information theory bound in sorting?
7. Intersecting a line and a simple polygon
8. Sorting Jordan sequences in linear time
9. Planarity testing in V log V steps: Extended abstract
10. Efficient planarity testing
11. A new data structure for representing sorted lists
12. An algorithm for planarity testing of graphs
13. Hysterical B-trees
14. Nearly optimal binary search trees
15. Planar permutations defined by two intersecting Jordan curves
16. Self-adjusting binary search trees
17. Amortized computational complexity