Searching for "An efficient graph algorithm for dominance constraints." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

An Efficient Graph Algorithm for Dominance Constraints
by Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel — 2003 — Journal of Algorithms
…AN EFFICIENT GRAPH ALGORITHM FOR DOMINANCE CONSTRAINTS ∗ ERNST ALTHAUS † , DENYS DUCHIER…
Cited by 26 (9 self) – Add To MetaCart

Non-Redundant Scope Disambiguation in Underspecified Semantics
by Rui Pedro Chaves — 2003 — PROCEEDINGS OF THE 8TH ESSLLI STUDENT SESSION
…). An efficient graph algorithm for dominance constraints. Journal of Algorithms, To appear. Blackburn, P. and J…
Cited by 6 (2 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB