Add to ORKGDominance based tree descriptions are widely used in computational linguistics. Many practical problems can be modelled by dominance graphs. We give a linear time algorithm for deciding configurability, which improves on previous results
AbstractWe present and illustrate by a sequence of examples an algorithm paradigm for solving NP- ha...
This thesis concerns tree decompositions. Trees are one of the simplest and most well understood cla...
In the minimum linear arrangement problem one wishes to assign distinct integers to the vertices of ...
Dominance constraints are logical tree descriptions originating from automata theory that have multi...
Dominance constraints are logical descriptions of trees that are widely used in computational lingui...
Dominance constraints are logical descriptions of trees that are widely used in computational lingui...
Abstract. Dominance constraints logically describe trees in terms of their adjacency and dominance, ...
Dominance constraints are logical descriptions of trees that are widely used in computational lingui...
Abstract. We present an efficient algorithm that checks the satisfiability of pure dominance constra...
Abstract. We give a randomized linear-time algorithm for computing themajorityruleconsensustree.Them...
Dominance constraints are logical descriptions of trees. Efficient algorithms for the subclass of n...
ISBN: 0-89871-558-XInternational audienceDominance constraints are logical descriptions of trees. Ef...
A linear time algorithm is presented for finding dominators in control flow graphs. 1 Introduction ...
We present an algorithmic framework (including a single data structure) that is extended into linear...
International audienceThe problems of determining minimum identifying, locating-dominating or open l...
AbstractWe present and illustrate by a sequence of examples an algorithm paradigm for solving NP- ha...
This thesis concerns tree decompositions. Trees are one of the simplest and most well understood cla...
In the minimum linear arrangement problem one wishes to assign distinct integers to the vertices of ...
Dominance constraints are logical tree descriptions originating from automata theory that have multi...
Dominance constraints are logical descriptions of trees that are widely used in computational lingui...
Dominance constraints are logical descriptions of trees that are widely used in computational lingui...
Abstract. Dominance constraints logically describe trees in terms of their adjacency and dominance, ...
Dominance constraints are logical descriptions of trees that are widely used in computational lingui...
Abstract. We present an efficient algorithm that checks the satisfiability of pure dominance constra...
Abstract. We give a randomized linear-time algorithm for computing themajorityruleconsensustree.Them...
Dominance constraints are logical descriptions of trees. Efficient algorithms for the subclass of n...
ISBN: 0-89871-558-XInternational audienceDominance constraints are logical descriptions of trees. Ef...
A linear time algorithm is presented for finding dominators in control flow graphs. 1 Introduction ...
We present an algorithmic framework (including a single data structure) that is extended into linear...
International audienceThe problems of determining minimum identifying, locating-dominating or open l...
AbstractWe present and illustrate by a sequence of examples an algorithm paradigm for solving NP- ha...
This thesis concerns tree decompositions. Trees are one of the simplest and most well understood cla...
In the minimum linear arrangement problem one wishes to assign distinct integers to the vertices of ...