Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
暂无分享,去创建一个
[1] Serge Abiteboul,et al. Foundations of Databases , 1994 .
[2] Jean-Pierre Jouannaud,et al. Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[3] Wolfgang Bibel,et al. Constraint Satisfaction from a Deductive Viewpoint , 1988, Artif. Intell..
[4] Mihalis Yannakakis,et al. Algorithms for Acyclic Database Schemes , 1981, VLDB.
[5] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .
[6] Anand Rajaraman,et al. Conjunctive query containment revisited , 1997, Theor. Comput. Sci..
[7] Phokion G. Kolaitis,et al. Conjunctive-Query Containment and Constraint Satisfaction , 2000, J. Comput. Syst. Sci..
[8] Marina Moscarini,et al. Distance-Hereditary Graphs, Steiner Trees, and Connected Domination , 1988, SIAM J. Comput..
[9] Hans L. Bodlaender,et al. Treewidth: Algorithmic Techniques and Results , 1997, MFCS.
[10] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs VII: Graphs as Relational Structures , 1992, Theor. Comput. Sci..
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Ashok K. Chandra,et al. Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.
[13] Hans-Jürgen Bandelt,et al. Distance-hereditary graphs , 1986, J. Comb. Theory, Ser. B.
[14] Ronald Fagin,et al. Degrees of acyclicity for hypergraphs and relational database schemes , 1983, JACM.
[15] Jörg Flum,et al. Query evaluation via tree-decompositions , 2001, JACM.
[16] Bruno Courcelle,et al. Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..
[17] Vadim V. Lozin,et al. On the linear structure and clique-width of bipartite permutation graphs , 2003, Ars Comb..
[18] Thomas Schwentick,et al. When is the evaluation of conjunctive queries tractable? , 2001, STOC '01.
[19] Bruno Courcelle,et al. Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[20] Georg Gottlob,et al. A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.
[21] Peter L. Hammer,et al. Completely separable graphs , 1990, Discret. Appl. Math..
[22] Bruno Courcelle,et al. Handle-Rewriting Hypergraph Grammars , 1993, J. Comput. Syst. Sci..
[23] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[24] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[25] Giorgio Ausiello,et al. Chordality properties on graphs and minimal conceptual connections in semantic data models , 1985, PODS '85.
[26] Tobias Nipkow,et al. Term rewriting and all that , 1998 .
[27] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.
[28] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.
[29] Larry Joseph Stockmeyer,et al. The complexity of decision problems in automata theory and logic , 1974 .
[30] Udi Rotics,et al. On the Clique-Width of Perfect Graph Classes , 1999, WG.
[31] Udi Rotics,et al. Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract) , 2000, Latin American Symposium on Theoretical Informatics.
[32] Georg Gottlob,et al. Hypertree decompositions and tractable queries , 1998, PODS '99.
[33] Kenneth Kunen,et al. Answer Sets and Negation-as-Failure , 1987, ICLP.
[34] Georg Gottlob,et al. The complexity of acyclic conjunctive queries , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[35] Stephan Merz,et al. Model Checking , 2000 .
[36] Hans L. Bodlaender,et al. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.
[37] B. Reed,et al. Polynomial Time Recognition of Clique-Width ≤ 3 Graphs , 2000 .
[38] Jörg Flum,et al. Query Evaluation via Tree-Decompositions , 2001, ICDT.