Sebastian Miele

Learn More
Dominance constraints are logical descriptions of trees. Efficient algorithms for the subclass of <i>normal dominance constraints</i> were recently proposed. We present a new and simpler graph algorithm solving these constraints more efficiently, in quadratic time per solved form. It also applies to weakly normal dominance constraints as needed for an(More)
  • 1