Found: 5
Select item for more details and to access through your institution.
O(1) Query Time Algorithm for All Pairs Shortest Distances on Interval Graphs.
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 4, p. 465, doi. 10.1142/S0129054199000320
- By:
- Publication type:
- Article
Efficient Algorithms for the Maximum Sum Problems.
- Published in:
- Algorithms, 2017, v. 10, n. 1, p. 5, doi. 10.3390/a10010005
- By:
- Publication type:
- Article
O(1) Time Algorithms for Combinatorial Generation by Tree Traversal.
- Published in:
- Computer Journal, 1999, v. 42, n. 5, p. 400, doi. 10.1093/comjnl/42.5.400
- By:
- Publication type:
- Article
FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION.
- Published in:
- International Journal of Foundations of Computer Science, 2007, v. 18, n. 2, p. 263, doi. 10.1142/S0129054107004681
- By:
- Publication type:
- Article
ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS.
- Published in:
- International Journal of Foundations of Computer Science, 2007, v. 18, n. 2, p. 319, doi. 10.1142/S012905410700470X
- By:
- Publication type:
- Article