Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-4
|
Results: 4
An O(n log n) algorithm for finding a shortest central link segment
Authors:
Aleksandrov, LG Djidjev, HN Sack, JR
Citation:
Lg. Aleksandrov et al., An O(n log n) algorithm for finding a shortest central link segment, INT J C GEO, 10(2), 2000, pp. 157-188
Improved algorithms for dynamic shortest paths
Authors:
Djidjev, HN Pantziou, GE Zaroliagis, CD
Citation:
Hn. Djidjev et al., Improved algorithms for dynamic shortest paths, ALGORITHMIC, 28(4), 2000, pp. 367-389
Partitioning planar graphs with vertex costs: Algorithms and applications
Authors:
Djidjev, HN
Citation:
Hn. Djidjev, Partitioning planar graphs with vertex costs: Algorithms and applications, ALGORITHMIC, 28(1), 2000, pp. 51-75
Link distance problems
Authors:
Maheshwari, A Sack, JR Djidjev, HN
Citation:
A. Maheshwari et al., Link distance problems, HANDBOOK OF COMPUTATIONAL GEOMETRY, 2000, pp. 519-558
Risultati:
1-4
|