A new algorithm for normal dominance constraints

MaRDI QIDQ5501243zbMATH OpenFDO

Authors Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele

Publication date 3 August 2015

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) Logic in computer science (03B70) Natural language processing (68T50)

Recommendations

• An efficient graph algorithm for dominance constraints
• An efficient algorithm for the configuration problem of dominance graphs
• scientific article; zbMATH DE number 1689581
• scientific article; zbMATH DE number 2086393
• scientific article; zbMATH DE number 1696805

Cited in

(7)

• Combining tree partitioning, precedence, and incomparability constraints
• scientific article; zbMATH DE number 1689581 (Why is no real title available?)
• An efficient graph algorithm for dominance constraints
• scientific article; zbMATH DE number 2086393 (Why is no real title available?)
• An efficient algorithm for the configuration problem of dominance graphs
• Dominance constraints in stratified context unification
• scientific article; zbMATH DE number 1696805 (Why is no real title available?)

This page was built for publication: A new algorithm for normal dominance constraints

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