Deterministic Dcomposition of Recursive Graph Classes

DOI10.1137/0404043zbMath0754.05055OpenAlexW2016461430MaRDI 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

zbMATH Keywords

dynamic programmingseries-parallel graphlinear-time algorithmrecursive graph classdeterministic decompositionHalin graph classes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

On Halin subgraphs and supergraphs, 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, On minimum cuts and the linear arrangement problem