Some modified algorithms for Dijkstra's longest upsequence problem (Q1161300): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Some beautiful arguments using mathematical induction / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4057549 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Significant Improvements to the Hwang-Lin Merging Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Ford-Johnson Sorting Algorithm Is Not Optimal / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Observations Concerning Formal Differentiation of Set Theoretic Expressions / rank | |||
Normal rank | |||
Revision as of 15:00, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some modified algorithms for Dijkstra's longest upsequence problem |
scientific article |
Statements
Some modified algorithms for Dijkstra's longest upsequence problem (English)
0 references
1982
0 references
merge algorithms
0 references
merging
0 references
sorting
0 references
