Abstract.
Some hypermedia synchronization issues request the resolution of the minimum convex piecewise linear cost tension problem (CPLCT problem) on directed graphs that are close to two-terminal series-parallel graphs (TTSP-graphs), the so-called quasi-k series-parallel graphs (k-QSP graphs). An aggregation algorithm has already been introduced for the CPLCT problem on TTSP-graphs. We propose here a reconstruction method, based on the aggregation and the well-known out-of-kilter techniques, to solve the problem on k-QSP graphs. One of the main steps being to decompose a graph into TTSP-subgraphs, methods based on the recognition of TTSP-graphs are thoroughly discussed.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: October 2003, Revised: July 2004,
MSC classification:
90C35, 05C85
Rights and permissions
About this article
Cite this article
Bachelet, B., Mahey, P. Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs. 4OR 2, 275–291 (2004). https://doi.org/10.1007/s10288-004-0049-3
Issue Date:
DOI: https://doi.org/10.1007/s10288-004-0049-3