Tree Automata, Tree Decomposition and Hyperedge Replacement
暂无分享,去创建一个
[1] John Doner,et al. Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..
[2] Alfred V. Aho,et al. Currents In The Theory Of Computing , 1973 .
[3] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[4] Paul D. Seymour,et al. Graph minors. VI. Disjoint paths across a disc , 1986, J. Comb. Theory, Ser. B.
[5] Derek G. Corneil,et al. Complexity of finding embeddings in a k -tree , 1987 .
[6] Annegret Habel,et al. Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement , 1991, Theor. Comput. Sci..
[7] Oliver Vornberger,et al. On Some Variants of the Bandwidth Minimization Problem , 1984, SIAM J. Comput..
[8] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..
[9] Detlef Seese,et al. Problems Easy for Tree-Decomposable Graphs (Extended Abstract) , 1988, ICALP.
[10] Clemens Lautemann,et al. Efficient Algorithms on Context-Free Graph Grammars , 1988, ICALP.
[11] David S. Johnson. The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.
[12] james w.thatcher,et al. tree automata: an informal survey , 1974 .
[13] Bruno Courcelle. An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars , 1987, Theor. Comput. Sci..
[14] Thomas Lengauer,et al. Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract) , 1988, ICALP.
[15] Stefan Arnborg,et al. Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.
[16] Walter L. Ruzzo,et al. Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..
[17] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.
[18] Hans L. Bodlaender,et al. Dynamic Programming on Graphs with Bounded Treewidth , 1988, ICALP.
[19] Annegret Habel,et al. Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement , 1987, STACS.
[20] Clemens Lautemann,et al. Decomposition Trees: Structured Graph Representation and Efficient Algorithms , 1988, CAAP.