Algorithms for graph problems on BNLC structured garphs

DOI10.1016/0890-5401(91)90035-ZzbMath0751.68034MaRDI QIDQ1175948

Egon Wanke

Publication date: 25 June 1992

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

graph grammarsBNLC graph languagescontext-free graph languages

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Related Items (5)

Node replacements in embedding normal form. ⋮ The complexity of connectivity problems on context-free graph languages ⋮ Exponential time analysis of confluent and boundary eNCE graph languages ⋮ Bounded tree-width and LOGCFL ⋮ Finite graph automata for linear and boundary graph languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph theoretic closure properties of the family of boundary NLC graph languages
• Combinatorial properties of boundary NLC graph languages
• Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
• Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs

This page was built for publication: Algorithms for graph problems on BNLC structured garphs