论文信息 - Experimental study of algorithms for connected row convex constraints - 字舞流文

Experimental study of algorithms for connected row convex constraints

Satyanarayana Marisetti | Satyanarayana Marisetti

[1] Robert E. Tarjan,et al. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[2] T. K. Satish Kumar. Simple Randomized Algorithms for Tractable Row and Tree Convex Constraints , 2006, AAAI.

[3] Peter van Beek,et al. On the minimality and global consistency of row-convex constraint networks , 1995, JACM.

[4] S. Parter. The Use of Linear Graphs in Gauss Elimination , 1961 .

[5] Pascal Van Hentenryck,et al. Constraint Satisfaction over Connected Row Convex Constraints , 1997, Artif. Intell..

[6] Roland H. C. Yap,et al. Consistency and set intersection , 2003, IJCAI.

[7] Yuanlin Zhang. Fast Algorithm for Connected Row Convex Constraints , 2007, IJCAI.

[8] M. Yannakakis. Computing the Minimum Fill-in is NP^Complete , 1981 .

[9] Alastair Smith,et al. How not to do it , 2005 .

[10] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[11] Ugo Montanari,et al. Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[12] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .

[13] Rina Dechter,et al. Directed Constraint Networks: A Relational Framework for Causal Modeling , 1991, IJCAI.