An Efficient Algorithm for the Configuration Problem of Dominance Graphs

Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, and Sven Thiel

In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), Washington, DC, 2001.

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 normal 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.

Download: Download

BibTeX Entry
@InProceedings{dom-graph,
	author = {Ernst Althaus and Denys Duchier and Alexander Koller 
		and Kurt Mehlhorn and Joachim Niehren and Sven Thiel},
	title = {An Efficient Algorithm for the Configuration Problem of 
		Dominance Graphs},
	year = 2001,
	booktitle = {Proceedings of the 12th ACM-SIAM Symposium on 
		Discrete Algorithms (SODA)},
	address = {Washington, DC}
}

Back: Publications