On polynomial time graph grammars

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Article 25 Jan 2006 English Publisher:Springer Science and Business Media LLC

Authors: Franz-Josef Brandenburg;

doi: 10.1007/bfb0035847

On polynomial time graph grammars

- Summary
- Metrics

Abstract

The complexity of node rewriting graph grammars is investigated, i.e. the membership problem for sets of graphs L(G) generated by directed, node and edge label controlled graph grammars G. We improve known results on the membership problem and comprise them into the following sharp characterization of the P vs. NP borderline, which is an "if and only if" result.

Related Organizations

University of Passau
Germany

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	27
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%

Found an issue? Give us feedback

27

Average

Top 10%

Upload OA version

Are you the author of this publication? Upload your Open Access version to Zenodo!

It’s fast and easy, just two clicks!

uploadUpload now