On computing a longest path in a tree
From MaRDI portal
Publication:1603531
DOI10.1016/S0020-0190(01)00198-3zbMath1032.68671OpenAlexW2045021308WikidataQ56639270 ScholiaQ56639270MaRDI QIDQ1603531
R. W. Bulterman, F. W. van der Sommen, Tom Verhoeff, Gerard Zwaan
Publication date: 14 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00198-3
Related Items (22)
An approximation algorithm for the longest cycle problem in solid grid graphs ⋮ Upward Planar Drawings with Three and More Slopes ⋮ The Longest Path Problem Is Polynomial on Interval Graphs ⋮ On orthogonal ray graphs ⋮ Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs ⋮ The longest path problem is polynomial on cocomparability graphs ⋮ Faster swap edge computation in minimum diameter spanning trees ⋮ On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs ⋮ On orthogonal ray trees ⋮ The longest path problem has a polynomial solution on interval graphs ⋮ Longest (s, t)-paths in L-shaped grid graphs ⋮ Computing and counting longest paths on circular-arc graphs in polynomial time ⋮ The Hamiltonian connectivity of rectangular supergrid graphs ⋮ On the number of 2-packings in a connected graph ⋮ The Longest Path Problem is Polynomial on Cocomparability Graphs ⋮ ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES ⋮ A genetic algorithm for the picture maze generation problem ⋮ Center location problems on tree graphs with subtree-shaped customers ⋮ Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs ⋮ An approximation algorithm for the longest path problem in solid grid graphs ⋮ A linear-time algorithm for the longest path problem in rectangular grid graphs ⋮ Inverse single facility location problem on a tree with balancing on the distance of server to clients
This page was built for publication: On computing a longest path in a tree
