An efficient algorithm for the configuration problem of dominance graphs

MaRDI QIDQ2768386zbMATH OpenFDO

Authors Ernst Althaus, Denys Duchier, Alexander Koller, K. Mehlhorn, Joachim Niehren, Sven Thiel

Publication date 24 March 2002

zbMATH Keywords

automata theorydominance constraints

Mathematics Subject Classification ID

Graph theory (05C99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An efficient graph algorithm for dominance constraints
• A new algorithm for normal dominance constraints
• scientific article; zbMATH DE number 1689581
• scientific article; zbMATH DE number 2086393
• scientific article; zbMATH DE number 1696805

Cited in

(8)

• Configuration of labeled trees under lexicalized constraints and principles
• An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators
• Dominance constraints with Boolean connectives: A model-eliminative treatment
• scientific article; zbMATH DE number 1689581 (Why is no real title available?)
• Efficient Computation of Dominance in Component Systems (Short Paper)
• An efficient graph algorithm for dominance constraints
• scientific article; zbMATH DE number 2086393 (Why is no real title available?)
• A new algorithm for normal dominance constraints

This page was built for publication: An efficient algorithm for the configuration problem of dominance graphs

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