Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Double_pushout_graph_rewriting> ?p ?o }
Showing triples 1 to 12 of
12
with 100 triples per page.
- Double_pushout_graph_rewriting abstract "In computer science, double pushout graph rewriting or (DPO graph rewriting) refers to a mathematical framework for graph rewriting. It was introduced in as one of the first algebraic approaches to graph rewriting in the article "Graph-grammars: An algebraic approach" (1973). It has since been generalized to allow rewriting structures which are not graphs, and to handle negative application conditions, among other extensions.".
- Double_pushout_graph_rewriting wikiPageID "35717039".
- Double_pushout_graph_rewriting wikiPageRevisionID "583630743".
- Double_pushout_graph_rewriting subject Category:Graph_algorithms.
- Double_pushout_graph_rewriting subject Category:Graph_rewriting.
- Double_pushout_graph_rewriting comment "In computer science, double pushout graph rewriting or (DPO graph rewriting) refers to a mathematical framework for graph rewriting. It was introduced in as one of the first algebraic approaches to graph rewriting in the article "Graph-grammars: An algebraic approach" (1973). It has since been generalized to allow rewriting structures which are not graphs, and to handle negative application conditions, among other extensions.".
- Double_pushout_graph_rewriting label "Double pushout graph rewriting".
- Double_pushout_graph_rewriting sameAs m.0zc0vt0.
- Double_pushout_graph_rewriting sameAs Q17009459.
- Double_pushout_graph_rewriting sameAs Q17009459.
- Double_pushout_graph_rewriting wasDerivedFrom Double_pushout_graph_rewriting?oldid=583630743.
- Double_pushout_graph_rewriting isPrimaryTopicOf Double_pushout_graph_rewriting.