scientific article

From MaRDI portal

Revision as of 13:28, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3785989

Jump to:navigation, search

zbMath0643.68107MaRDI QIDQ3785989

Franz-Josef Brandenburg

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexity spanning tree rewriting NP-complete PSPACE-complete tree-graph grammars ECE embeddings ELC embeddings NLC embeddings node and edge labeled graphs partially ordered graph grammar

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (11)

Handle-rewriting hypergraph grammars ⋮ The equivalence of boundary and confluent graph grammars on graph languages of bounded degree ⋮ The bounded degree problem for eNCE graph grammars ⋮ Power properties of NLC graph grammars with a polynomial membership problem ⋮ Exponential time analysis of confluent and boundary eNCE graph languages ⋮ Boundary graph grammars with dynamic edge relabeling ⋮ A comparison of boundary graph grammars and context-free hypergraph grammars ⋮ The bounded degree problem for non-obstructing eNCE graph grammars ⋮ The complexity of graph languages generated by hyperedge replacement ⋮ Generating irregular partitionable data structures ⋮ Nonterminal separation in graph grammars

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3785989&oldid=17345120"