EFFICIENT ALGORITHMS FOR OPTIMIZATION AND SELECTION ON SERIES-PARALLEL GRAPHS

作     者：HASSIN, R TAMIR, A 

出 版 物：《SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS》 

年 卷 期：1986年第7卷第3期

页      面：379-389页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主　　题：90C35 series-parallel graphs graph decomposition selection algorithms uncapacitated plant location problem 

摘      要：It is well known that a series-parallel multigraph G can be constructed recursively from its edges. This construction is represented by a binary decomposition tree. This is a rooted binary tree T in which each vertex q corresponds to some series-parallel submultigraph of G, denoted by G(q) role=presentationG(q)G(q)script type=math/tex