A New Algorithm for Normal Dominance Constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

A New Algorithm for Normal Dominance Constraints

Abstract

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.
Fichier principal
Vignette du fichier
wndc.pdf (160.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00536536 , version 1 (18-11-2010)

Identifiers

  • HAL Id : inria-00536536 , version 1

Cite

Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele. A New Algorithm for Normal Dominance Constraints. ACM-SIAM Symposium on Discrete Algorithms - SODA'2003, Jan 2004, New Orleans, Louisiana, United States. pp.59-67. ⟨inria-00536536⟩
311 View
134 Download

Share

Gmail Facebook X LinkedIn More