scientific article; zbMATH DE number 140151

MaRDI QIDQ4028536zbMATH OpenFDO

Authors Richard B. Borie

Publication date 28 March 1993

zbMATH Keywords

graph classespolynomial time algorithmspartial \(k\)-trees

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Algorithms for recognition of regular properties and decomposition of recursive graph families
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
• Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
• Characterization and Recognition of Partial 3-Trees
• scientific article; zbMATH DE number 4024784

Cited in

(8)

• scientific article; zbMATH DE number 4053039 (Why is no real title available?)
• On the speed of algebraically defined graph classes
• scientific article; zbMATH DE number 46126 (Why is no real title available?)
• scientific article; zbMATH DE number 3910423 (Why is no real title available?)
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
• Regularity and locality in \(k\)-terminal graphs
• Nonconstructive tools for proving polynomial-time decidability
• Constructivity issues in graph algorithms

This page was built for publication:

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