Searching for "The Bounded Degree Problem for eNCE Graph Grammars." – sorted by Relevance.
-
Degree Problems for eNCE Graph Grammars
- of the bounded degree problem is analyzed for graph languages generated by eNCE graph grammars. In particular
- Cited by 2 (2 self) – Add To MetaCart
-
The complexity of the Kn,n-problem for node replacement graph languages
- generalization of the bounded degree problem for eNCE graph grammars from [JRW86, SW97]. By a pumping argument we
- Add To MetaCart

