Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata
Contributor : Joachim Niehren Connect in order to contact the contributor
Submitted on : Tuesday, November 16, 2010 - 11:09:16 PM
Last modification on : Friday, February 11, 2022 - 6:44:04 PM
Long-term archiving on: : Thursday, February 17, 2011 - 3:13:33 AM


Files produced by the author(s)


  • HAL Id : inria-00536803, version 1


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⟩



Record views


Files downloads