BulDML at Institute of Mathematics and Informatics >
IMI Periodicals >
Serdica Journal of Computing >
2013 >
Volume 7 Number 2 >

Please use this identifier to cite or link to this item:

Title: Programming and Testing a Two-Tree Algorithm
Authors: Vassilev, Tzvetalin
Ammerlaan, Joanna
Keywords: Longest Path
Experimental Analysis
Issue Date: 2013
Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences
Citation: Serdica Journal of Computing, Vol. 7, No 2, (2013), 115p-134p
Abstract: 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.
Description: ACM Computing Classification System (1998): G.2.2, F.2.2.
ISSN: 1312-6555
Appears in Collections:Volume 7 Number 2

Files in This Item:

File Description SizeFormat
sjc-vol7-num2-2013-p115-p134.pdf1.72 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!   Creative Commons License