Geodesic
Programming and Testing a Two-Tree Algorithm
Serdica Journal of Computing, Tome 7 (2013) no. 2, pp. 115-134 Cet article a éte moissonné depuis la source Bulgarian Digital Mathematics Library

Voir la notice de l'article

Recently, Markov, Vassilev and Manev [2] proposed an algorithm for finding the longest path in 2-trees. In this paper, we describe an implementation of the algorithm. We briefly discuss the algorithm and present example that helps the reader grasp the main algorithmic ideas. Further, we discuss the important stages in the implementation of the algorithm and justify the decisions taken. Then, we present experimental results and discuss them in the light of the dependence on the platform and machine architecture. We present timing analysis of the implementation, as well as results on the average length of the longest path.
Keywords: Longest Path, 2-Trees, Divide-and-Conquer, Experimental Analysis 
@article{SJC_2013_7_2_a1,
     author = {Vassilev, Tzvetalin and Ammerlaan, Joanna},
     title = {Programming and {Testing} a {Two-Tree} {Algorithm}},
     journal = {Serdica Journal of Computing},
     pages = {115--134},
     year = {2013},
     volume = {7},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SJC_2013_7_2_a1/}
}
TY  - JOUR
AU  - Vassilev, Tzvetalin
AU  - Ammerlaan, Joanna
TI  - Programming and Testing a Two-Tree Algorithm
JO  - Serdica Journal of Computing
PY  - 2013
SP  - 115
EP  - 134
VL  - 7
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/SJC_2013_7_2_a1/
LA  - en
ID  - SJC_2013_7_2_a1
ER  - 
%0 Journal Article
%A Vassilev, Tzvetalin
%A Ammerlaan, Joanna
%T Programming and Testing a Two-Tree Algorithm
%J Serdica Journal of Computing
%D 2013
%P 115-134
%V 7
%N 2
%U http://geodesic.mathdoc.fr/item/SJC_2013_7_2_a1/
%G en
%F SJC_2013_7_2_a1
Vassilev, Tzvetalin; Ammerlaan, Joanna. Programming and Testing a Two-Tree Algorithm. Serdica Journal of Computing, Tome 7 (2013) no. 2, pp. 115-134. http://geodesic.mathdoc.fr/item/SJC_2013_7_2_a1/