The tree longest detour problem in a biconnected graph.

DOI10.1016/S0377-2217(03)00126-7zbMath1043.90084MaRDI QIDQ1427585

Shyue-Ming Tang, Yue-Li Wang, Ting-Yem Ho, Fu-Long Yeh

Publication date: 14 March 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Graph theoryBiconnected graphsDetour-critical edgeShortest path treeTree longest detour problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Finding the detour-critical edge of a shortest path between two nodes
• The k most vital arcs in the shortest path problem
• Most vital links and nodes in weighted networks
• Finding the most vital edge with respect to minimum spanning tree in weighted graphs
• A generalization of Dijkstra's algorithm
• Applications of Path Compression on Balanced Trees

This page was built for publication: The tree longest detour problem in a biconnected graph.