An efficient algorithm for the configuration problem of dominance graphs

Authors:
Ernst Althaus;Denys Duchier;Alexander Koller;Kurt Mehlhorn;Joachim Niehren;Sven Thiel
Affiliations:
Max-Planck-Institute for Computer Science, Saarbrücken, Germany;programming Systems Lab, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, Germany;Department of Computational Linguistics, Universität des Saarlandes, Saarbrücken, Germany;Max-Planck-Institute for Computer Science, Saarbrücken, Germany;programming Systems Lab, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, Germany;Max-Planck-Institute for Computer Science, Saarbrücken, Germany
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 9
Cited 4

An O(EV log V) algorithm for finding a maximal weighted matching in general graphs

SIAM Journal on Computing
Using descriptions of trees in a tree adjoining grammar

Computational Linguistics
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Constraints over Lambda-Structures in semantic underspecification

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
D-theory: talking about talking about trees

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
D-tree grammars

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
On determining the consistency of partial descriptions of trees

ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
A polynomial-time fragment of dominance constraints

ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics

Dominance constraints with Boolean connectives: a model-eliminative treatment

Theoretical Computer Science - Algebraic methods in language processing
Pure Dominance Constraints

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Parallelism and Tree Regular Constraints

LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
An efficient graph algorithm for dominance constraints

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

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