Abstract
Abstract We present algorithms for analyzing single graphs and sets of graphs generated by boundary node label controlled (BNLC) graph grammars. This paper extends a unified framework for developing algorithms on context-free graph languages to BNLC graph languages. Graphs in BNLC graph languages do not necessarily have vertex separators of bounded size as do graphs in context-free graph languages. We give combinatorial decision and query algorithms on single graphs generated by a deterministic BNLC graph grammar and algorithms for the following question: Does the language of a given BNLC graph grammar contain a graph that fulfills a certain graph property? All algorithms developed in this paper consider the graph grammar as input.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
