Publication details

Saarland University Computer Science

A New Algorithm for Normal Dominance Constraints

Manuel Bodirsky, Denys Duchier, Sebastian Miele, Joachim Niehren

ACM-SIAM Symposium on Discrete Algorithms, pp. 54-78, The ACM Press, January 2004

Dominance constraints are logical descriptions of trees. Efficient algorithms for the subclass of normal dominance constraints were recently proposed. We present a new and simpler graph algorithm solving these constraints more efficiently, in quadratic time per solved form. It also applies to weakly normal dominance constraints as needed for an application to computational linguistics. Subquadratic running time can be achieved employing decremental graph biconnectivity algorithms.

Download PDF        Show BibTeX               

Login to edit

Legal notice, Privacy policy