Boundary NlC and partition controlled graph grammars
暂无分享,去创建一个
[1] Annegret Habel,et al. May we introduce to you: hyperedge replacement , 1986, Graph-Grammars and Their Application to Computer Science.
[2] Emo Welzl. On the Set of all Subgraphs of the Graphs in a Boundary NLC Graph Language , 1986 .
[3] Franz-Josef Brandenburg. On the Complexity of the Membership Problem of Graph Grammars , 1983, WG.
[4] Grzegorz Rozenberg,et al. Combinatorial properties of boundary NLC graph languages , 1987, Discret. Appl. Math..
[5] Klaus-Jörn Lange,et al. String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing , 1987, Discret. Appl. Math..
[6] Annegret Habel,et al. Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement , 1987, STACS.
[7] Michael Randolph Garey,et al. Johnson: "computers and intractability , 1979 .
[8] Grzegorz Rozenberg,et al. Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity , 1986, Inf. Control..
[9] Grzegorz Rozenberg,et al. On the structure of node-label-controlled graph languages , 1980, Inf. Sci..
[10] A. O. Slisenko. Context-Free Grammars as a Tool for Describing Polynomial-Time Subclasses of Hard Problems , 1982, Inf. Process. Lett..
[11] Eitan M. Gurari,et al. Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem , 1984, J. Algorithms.
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[13] Grzegorz Rozenberg,et al. Restrictions, extensions, and variations of NLC grammars , 1980, Inf. Sci..
[14] Grzegorz Rozenberg,et al. The Book of L , 1986, Springer Berlin Heidelberg.