Deterministic Dcomposition of Recursive Graph Classes
From MaRDI portal
Publication:3985535
DOI10.1137/0404043zbMath0754.05055MaRDI QIDQ3985535
R. Gary Parker, Craig A. Tovey, Richard B. Borie
Publication date: 27 June 1992
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0404043
dynamic programming; series-parallel graph; linear-time algorithm; recursive graph class; deterministic decomposition; Halin graph classes
68R10: Graph theory (including graph drawing) in computer science
90C39: Dynamic programming
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
On Halin subgraphs and supergraphs, On minimum cuts and the linear arrangement problem, Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs, Scheduling of pipelined operator graphs, Tree decomposition and discrete optimization problems: a survey