A Linear Time Algorithm for Computing Longest Paths in Cactus Graphs - Archive ouverte HAL Access content directly
Journal Articles Serdica Journal of Computing (ISSN: 1312-6555) Year : 2012

A Linear Time Algorithm for Computing Longest Paths in Cactus Graphs

Abstract

We propose an algorithm that computes the length of a longest path in a cactus graph. Our algorithm can easily be modified to output a longest path as well or to solve the problem on cacti with edge or vertex weights. The algorithm works on rooted cacti and assigns to each vertex a two-number label, the first number being the desired parameter of the subcactus rooted at that vertex. The algorithm applies the divide-and-conquer approach and computes the label of each vertex from the labels of its children. The time complexity of our algorithm is linear in the number of vertices, thus improving the previously best quadratic time algorithm.
Fichier principal
Vignette du fichier
sjc-vol6-num3-2012-p287-p298.pdf (199.25 Ko) Télécharger le fichier
algorithmic_contest_tasks_2nd_author.zip (18.96 Mo) Télécharger le fichier
Origin : Explicit agreement for this submission
Format : Other
Loading...

Dates and versions

hal-00768843 , version 1 (25-12-2012)

Identifiers

  • HAL Id : hal-00768843 , version 1

Cite

Minko Markov, Mugurel Ionut Andreica, Krassimir Manev, Nicolae Tapus. A Linear Time Algorithm for Computing Longest Paths in Cactus Graphs. Serdica Journal of Computing (ISSN: 1312-6555), 2012, 6 (3), pp.287-298. ⟨hal-00768843⟩
82 View
486 Download

Share

Gmail Facebook Twitter LinkedIn More