Programming and Testing a Two-Tree Algorithm

Vassilev, Tzvetalin, and Ammerlaan, Joanna. "Programming and Testing a Two-Tree Algorithm." Serdica Journal of Computing 7.2 (2013): 115-134. <http://eudml.org/doc/268660>.

@article{Vassilev2013,
abstract = {ACM Computing Classification System (1998): G.2.2, F.2.2.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.},
author = {Vassilev, Tzvetalin, Ammerlaan, Joanna},
journal = {Serdica Journal of Computing},
keywords = {Longest Path; 2-Trees; Divide-and-Conquer; Experimental Analysis},
language = {eng},
number = {2},
pages = {115-134},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {Programming and Testing a Two-Tree Algorithm},
url = {http://eudml.org/doc/268660},
volume = {7},
year = {2013},
}

TY - JOUR
AU - Vassilev, Tzvetalin
AU - Ammerlaan, Joanna
TI - Programming and Testing a Two-Tree Algorithm
JO - Serdica Journal of Computing
PY - 2013
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 7
IS - 2
SP - 115
EP - 134
AB - ACM Computing Classification System (1998): G.2.2, F.2.2.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.
LA - eng
KW - Longest Path; 2-Trees; Divide-and-Conquer; Experimental Analysis
UR - http://eudml.org/doc/268660
ER -