Lecture Notes in Computer Science - Graph Grammars and Their Application to Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540612285, 9783540683889

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Reconfiguration Graph Grammar for massively parallel, fault tolerant computers

Lecture Notes in Computer Science - Graph Grammars and Their Application to Computer Science ◽

10.1007/3-540-61228-9_87 ◽

1996 ◽

pp. 185-195 ◽

Cited By ~ 2

Author(s):

M. D. Derk ◽

L. S. DeBrunner

Keyword(s):

Fault Tolerant ◽

Graph Grammar ◽

Massively Parallel

Download Full-text

A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths

Lecture Notes in Computer Science - Graph Grammars and Their Application to Computer Science ◽

10.1007/3-540-61228-9_106 ◽

1996 ◽

pp. 469-486

Author(s):

Stefan Arnborg ◽

Andrzej Proskurowski

Keyword(s):

Bounded Treewidth

Download Full-text

The contractum in algebraic graph rewriting

Lecture Notes in Computer Science - Graph Grammars and Their Application to Computer Science ◽

10.1007/3-540-61228-9_76 ◽

1996 ◽

pp. 16-26 ◽

Cited By ~ 1

Author(s):

R. Banach

Keyword(s):

Graph Rewriting

Download Full-text

Formal relationship between graph grammars and Petri nets

Lecture Notes in Computer Science - Graph Grammars and Their Application to Computer Science ◽

10.1007/3-540-61228-9_94 ◽

1996 ◽

pp. 288-303 ◽

Cited By ~ 7

Author(s):

Martin Korff ◽

Leila Ribeiro

Keyword(s):

Petri Nets ◽

Graph Grammars ◽

Formal Relationship

Download Full-text

Graph unification and matching

Lecture Notes in Computer Science - Graph Grammars and Their Application to Computer Science ◽

10.1007/3-540-61228-9_80 ◽

1996 ◽

pp. 75-88 ◽

Cited By ~ 10

Author(s):

Detlef Plump ◽

Annegret Habel

Download Full-text

An event structure semantics for graph grammars with parallel productions

Lecture Notes in Computer Science - Graph Grammars and Their Application to Computer Science ◽

10.1007/3-540-61228-9_91 ◽

1996 ◽

pp. 240-256 ◽

Cited By ~ 6

Author(s):

A. Corradini ◽

H. Ehrig ◽

M. Löwe ◽

U. Montanari ◽

F. Rossi

Keyword(s):

Event Structure ◽

Graph Grammars

Download Full-text

The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed

Lecture Notes in Computer Science - Graph Grammars and Their Application to Computer Science ◽

10.1007/3-540-61228-9_98 ◽

1996 ◽

pp. 351-367

Author(s):

B. Courcelle ◽

G. Sénizergues

Keyword(s):

Closed Set ◽

A Minor ◽

Hyperedge Replacement

Download Full-text

Issues in the practical use of graph rewriting

Lecture Notes in Computer Science - Graph Grammars and Their Application to Computer Science ◽

10.1007/3-540-61228-9_78 ◽

1996 ◽

pp. 38-55 ◽

Cited By ~ 24

Author(s):

Dorothea Blostein ◽

Hoda Fahmy ◽

Ann Grbavec

Keyword(s):

Graph Rewriting

Download Full-text

Process specification and verification

Lecture Notes in Computer Science - Graph Grammars and Their Application to Computer Science ◽

10.1007/3-540-61228-9_90 ◽

1996 ◽

pp. 225-239 ◽

Cited By ~ 3

Author(s):

Klaus Barthelmann

Keyword(s):

Process Specification ◽

Specification And Verification

Download Full-text

Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence

Lecture Notes in Computer Science - Graph Grammars and Their Application to Computer Science ◽

10.1007/3-540-61228-9_101 ◽

1996 ◽

pp. 397-411 ◽

Cited By ~ 6

Author(s):

Renate Klempien-Hinrichs

Keyword(s):

Hyperedge Replacement

Download Full-text

Lecture Notes in Computer Science - Graph Grammars and Their Application to Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Reconfiguration Graph Grammar for massively parallel, fault tolerant computers

A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths

The contractum in algebraic graph rewriting

Formal relationship between graph grammars and Petri nets

Graph unification and matching

An event structure semantics for graph grammars with parallel productions

The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed

Issues in the practical use of graph rewriting

Process specification and verification

Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence

Lecture Notes in Computer Science - Graph Grammars and Their Application to Computer Science
Latest Publications