A linear time algorithm for computing longest paths in 2-trees.

zbMATH Open1313.05097MaRDI QIDQ2936680FDOQ2936680

Authors Minko Markov, Tzvetalin S. Vassilev, Krassimir N. Manev 

Publication date 6 January 2015

zbMATH Keywords

treewidthlongest path2-treealgorithmic graph theory

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Recommendations

• Algorithms and Computation
• A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs
• A linear time algorithm for computing longest paths in cactus graphs
• On computing longest paths in small graph classes
• Programming and testing a two-tree algorithm

Cited in

(4)

• A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs
• A linear time algorithm for computing longest paths in cactus graphs
• Programming and testing a two-tree algorithm
• The longest cycle problem is polynomial on interval graphs

This page was built for publication: A linear time algorithm for computing longest paths in 2-trees.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936680)