An efficient graph algorithm for dominance constraints

DOI10.1016/S0196-6774(03)00050-6zbMATH Open1079.68107OpenAlexW2008431750MaRDI QIDQ4458877FDOQ4458877

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

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

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)

Cited In (7)

• Efficient Computation of Dominance in Component Systems (Short Paper)
• Dominance constraints with Boolean connectives: A model-eliminative treatment
• An efficient algorithm for the configuration problem of dominance graphs
• Title not available (Why is that?)
• A new algorithm for normal dominance constraints
• Title not available (Why is that?)
• Title not available (Why is that?)

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)