On computing a longest path in a tree
From MaRDI portal
Cited in
(22)- An approximation algorithm for the longest cycle problem in solid grid graphs
- The longest path problem is polynomial on cocomparability graphs
- Faster swap edge computation in minimum diameter spanning trees
- A linear-time algorithm for the longest path problem in rectangular grid graphs
- On the number of 2-packings in a connected graph
- On orthogonal ray graphs
- The Hamiltonian connectivity of rectangular supergrid graphs
- Center location problems on tree graphs with subtree-shaped customers
- On the complexity of exact algorithm for L(2,1)-labeling of graphs
- Longest (s, t)-paths in L-shaped grid graphs
- On computing longest paths in small graph classes
- A genetic algorithm for the picture maze generation problem
- The longest path problem is polynomial on cocomparability graphs
- The longest path problem has a polynomial solution on interval graphs
- On orthogonal ray trees
- Computing and counting longest paths on circular-arc graphs in polynomial time
- The Longest Path Problem Is Polynomial on Interval Graphs
- Neighborhood covering and independence on P₄-tidy graphs and tree-cographs
- Upward Planar Drawings with Three and More Slopes
- Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs
- Inverse single facility location problem on a tree with balancing on the distance of server to clients
- An approximation algorithm for the longest path problem in solid grid graphs
This page was built for publication: On computing a longest path in a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603531)
