scientific article; zbMATH DE number 1472110

zbMATH Open0956.68102MaRDI QIDQ4489161FDOQ4489161

Authors: M. Eduardo Kortright, Richard B. Borie 

Publication date: 23 October 2000

Title of this publication is not available (Why is that?)

Recommendations

• A generic approach to decomposition algorithms, with an application to digraph decomposition
• Deterministic Dcomposition of Recursive Graph Classes
• Efficient algorithms for decomposing graphs under degree constraints
• scientific article
• Recursively arbitrarily vertex-decomposable graphs
• NP-completeness of graph decomposition problems
• Enumerative applications of a decomposition for graphs and digraphs
• Efficiently parallelizable problems on a class of decomposable graphs

zbMATH Keywords

dynamic programmingdecomposabilitypredicate logic

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cited In (2)

• Decompositions of graphs of functions and fast iterations of lookup tables
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families

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 Q4489161)