A new algorithm for normal dominance constraints

zbMATH Open1318.05071MaRDI QIDQ5501243FDOQ5501243

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

Publication date: 3 August 2015

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

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)

Cited In (7)

• Dominance constraints in stratified context unification
• An efficient algorithm for the configuration problem of dominance graphs
• Title not available (Why is that?)
• An efficient graph algorithm for dominance constraints
• Combining tree partitioning, precedence, and incomparability constraints
• Title not available (Why is that?)
• Title not available (Why is that?)

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)