Contents

Ars Combinatoria

  • Research article

A Linear Time Algorithm for Computing Longest Paths in \(2\)-Trees

Minko Markov1, Tzvetalin S.Vassilev2, Krassimir Manev3
1Department of Computing Systems, Faculty of Mathematics and Informatics, “St. Kliment Ohridski” University of Sofia, 5 J. Bourchier Blvd, P.O. Box 48, BG-1164 Sofia, Bulgaria.
2Department of Computer Science and Mathematics, Nipissing University, 100 College Drive, Box 5002 North Bay, Ontario PIB 8L7, Canada.
3Department of Computing Systems, Faculty of Mathematics and Informatics, “St. Kliment Obridski” University of Sofia, 5 J. Bourchier Blvd, P.O. Box 48, BG-1164 Sofia, Bulgaria.
  • Published: 31/10/2013

Abstract

We propose a practical linear time algorithm for the LONGEST PATH problem on \(2\)-trees.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Minko Markov, Tzvetalin S.Vassilev, Krassimir Manev. A Linear Time Algorithm for Computing Longest Paths in \(2\)-Trees[J], Ars Combinatoria, Volume 112. 329-351. .