Some modified algorithms for Dijkstra's longest upsequence problem (Q1161300): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00625277 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024244897 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:54, 30 July 2024

scientific article
Language Label Description Also known as
English
Some modified algorithms for Dijkstra's longest upsequence problem
scientific article

    Statements