Complexity and Algorithms for Reasoning About Time: A Graph-Theoretic Approach (1992)

Cached

Download Links

by Martin Charles Golumbic , Ron Shamir
Citations:86 - 11 self

Documents Related by Co-Citation

2278 Maintaining knowledge about temporal intervals – James F. Allen, Lames F. Allen - 1983
371 Constraint propagation algorithms for temporal reasoning – Marc Vilain, Henry Kautz, Peter Beek - 1986
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
424 Networks of constraints: Fundamental properties and applications to picture processing – U Montanari - 1974
77 Exact and approximate reasoning about temporal relations – Peter van Beek, Robin Cohen - 1990
161 Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra – Bernhard Nebel, Hans-Jürgen Bürckert - 1995
137 Reasoning about Qualitative Temporal Information – Peter Van Beek - 1992
1155 Algorithmic Graph Theory and Perfect Graphs – M C Golumbic - 2004
1000 Consistency in networks of relations – A K Mackworth - 1977
69 On the topology of the genetic fine structure – S Benzer - 1959
49 Graph Sandwich Problems – Martin Charles Golumbic, Haim Kaplan, Ron Shamir - 1994
41 On the Complexity of DNA Physical Mapping – Martin Charles Golumbic, Haim Kaplan, Ron Shamir - 1994
23 The interpretation of temporal relations in narrative – Fei Song, Robin Cohen - 1988
54 Temporal reasoning and planning – James E Allen - 1991
264 The complexity of some polynomial network consistency algorithms for constraint satisfaction problems – A Mackworth, E Freuder - 1985
139 Combining Qualitative and Quantitative Constraints in Temporal Reasoning – Itay Meiri - 1996
40 Effective solution of qualitative interval constraint problems – P B Ladkin, A Reinefeld - 1992
24 Dense time and temporal constraints with 6 – M Koubarakis - 1992
43 Approximation Algorithms for Temporal Reasoning – P van Beek - 1989