Deterministic Dcomposition of Recursive Graph Classes

DOI10.1137/0404043MaRDI QIDQ3985535zbMATH OpenOpenAlexFDO

Authors R. G. 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

deterministic decompositiondynamic programmingHalin graph classeslinear-time algorithmrecursive graph classseries-parallel graph

Mathematics Subject Classification ID

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

Recommendations

• Publication:4489178
• Algorithms for recognition of regular properties and decomposition of recursive graph families
• Parallel algorithms for series parallel graphs
• scientific article; zbMATH DE number 1689046

Cited in

(9)

• Algorithms for recognition of regular properties and decomposition of recursive graph families
• 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
• GlobaL analysis of the deiete-contract recursion for graphs and matroids
• scientific article; zbMATH DE number 1472110 (Why is no real title available?)
• Context-Free Graph Properties via Definable Decompositions

This page was built for publication: Deterministic Dcomposition of Recursive Graph Classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3985535)