On-line sorting of twisted sequences in linear time
From MaRDI portal
Recommendations
- Tight bounds for online stable sorting
- Online and offline algorithms for the sorting buffers problem on the line metric
- On the time-space tradeoff for sorting with linear queries
- Efficient linear-time ranking and unranking of derangements
- scientific article; zbMATH DE number 522854
- Improved online algorithms for the sorting buffer problem on line metrics
- An algorithm for online topological ordering
- An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering
- On the linear complexity for multidimensional sequences
- scientific article; zbMATH DE number 3983066
Cites work
- scientific article; zbMATH DE number 3887059 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 4041254 (Why is no real title available?)
- scientific article; zbMATH DE number 3767009 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- Sorting jordan sequences in linear time using level-linked search trees
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Cited in
(6)- New exponential neighbourhood for polynomially solvable TSPs
- Polynomially solvable cases of the bipartite traveling salesman problem
- Simplified linear-time Jordan sorting and polygon clipping
- On Curling Numbers of Integer Sequences
- The travelling salesman and the PQ-tree
- Four-point conditions for the TSP: the complete complexity classification
This page was built for publication: On-line sorting of twisted sequences in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104753)
