On-line sorting of twisted sequences in linear time

DOI10.1007/BF01934085zbMath0647.68057MaRDI QIDQ1104753

Franz Aurenhammer

Publication date: 1988

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

sortingworst-case complexitytwisted sequences

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (5)

Simplified linear-time Jordan sorting and polygon clipping ⋮ The travelling salesman and the PQ-tree ⋮ Polynomially solvable cases of the bipartite traveling salesman problem ⋮ Four-point conditions for the TSP: the complete complexity classification ⋮ New exponential neighbourhood for polynomially solvable TSPs

Cites Work

• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Sorting jordan sequences in linear time using level-linked search trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On-line sorting of twisted sequences in linear time