TY - GEN A1 - Bodirsky, Manuel A1 - Duchier, Denys A1 - Miehle, Sebastian A1 - Niehren, Joachim T1 - A New Algorithm for Normal Dominance Constraints N2 - 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. Y1 - 2005 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/276 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-2769 ER -