Advertisement

4OR

, Volume 2, Issue 4, pp 275–291 | Cite as

Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs

  • Bruno BacheletEmail author
  • Philippe Mahey
Regular Paper

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.

Keywords:

Minimum cost tension two-terminal series-parallel digraph graph decomposition series-parallel recognition out-of-kilter algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin/Heidelberg 2004

Authors and Affiliations

  1. 1.LIMOS, UMR 6158-CNRSUniversité Blaise-PascalAubièreFrance

Personalised recommendations