An efficient graph algorithm for dominance constraints

DOI10.1016/S0196-6774(03)00050-6MaRDI QIDQ4458877zbMATH OpenOpenAlexFDO

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

Publication date 14 March 2004

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0196-6774(03)00050-6

zbMATH Keywords

dominance constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Natural language processing (68T50)

Recommendations

• An efficient algorithm for the configuration problem of dominance graphs
• 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

(7)

• Dominance constraints with Boolean connectives: A model-eliminative treatment
• A new algorithm for normal dominance constraints
• scientific article; zbMATH DE number 1689581 (Why is no real title available?)
• scientific article; zbMATH DE number 2086393 (Why is no real title available?)
• An efficient algorithm for the configuration problem of dominance graphs
• scientific article; zbMATH DE number 1696805 (Why is no real title available?)
• Efficient Computation of Dominance in Component Systems (Short Paper)

This page was built for publication: An efficient graph algorithm for dominance constraints

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