Pages that link to "Item:Q1161300"
From MaRDI portal
The following pages link to Some modified algorithms for Dijkstra's longest upsequence problem (Q1161300):
Displaying 4 items.
- An efficient algorithm for maxdominance, with applications (Q1115629) (← links)
- Finding a minimum independent dominating set in a permutation graph (Q1117255) (← links)
- An algorithm for the determination of longest increasing subsequence in a sequence (Q1119638) (← links)
- Computing the all-pairs longest chains in the plane (Q5060093) (← links)