An Efficient Algorithm for the Configuration Problem of Dominance Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

An Efficient Algorithm for the Configuration Problem of Dominance Graphs

Abstract

Dominance constraints are logical tree descriptions originating from automata theory that have multiple applications in computational linguistics. The satisfiability problem of dominance constraints is NP-complete. In most applications, however, only \emphnormal dominance constraints are used. The satisfiability problem of normal dominance constraints can be reduced in linear time to the configuration problem of dominance graphs, as shown recently. In this paper, we give a polynomial time algorithm testing configurability of dominance graphs (and thus satisfiability of normal dominance constraints). Previous to our work no polynomial time algorithms were known.
Fichier principal
Vignette du fichier
dom-graph.pdf (268.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00536803 , version 1 (16-11-2010)

Identifiers

  • HAL Id : inria-00536803 , version 1

Cite

Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, et al.. An Efficient Algorithm for the Configuration Problem of Dominance Graphs. Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, Washington, DC, United States. pp.815--824. ⟨inria-00536803⟩
149 View
38 Download

Share

Gmail Facebook Twitter LinkedIn More