A note on the tour problems in two-terminal series-parallel graphs

DOI10.1016/0020-0255(93)90035-KzbMath0783.68095OpenAlexW1974746598MaRDI QIDQ1310922

V. Pereyra

Publication date: 13 January 1994

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(93)90035-k

zbMATH Keywords

schedulingelectric networks\(NP\)-completebottleneck two-tour problemshortest complete tourTTSP graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs ⋮ The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel recognition and decomposition of two terminal series parallel graphs
• Topology of series-parallel networks
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Binary tree algebraic computation and parallel algorithms for simple graphs
• Linear-time computability of combinatorial problems on series-parallel graphs

This page was built for publication: A note on the tour problems in two-terminal series-parallel graphs