The bounded tree-width problem of context-free graph languages (Q4373689)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1107740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The bounded tree-width problem of context-free graph languages |
scientific article; zbMATH DE number 1107740 |
Statements
23 June 1998
0 references
graph grammars
0 references
0.848061203956604
0 references
0.8344869017601013
0 references
0.8194735050201416
0 references
The bounded tree-width problem of context-free graph languages (English)
0 references
