Logical Description of Context-free Graph Languages

Joost Engelfriet; Vincent van Oostrom

doi:10.1006/jcss.1997.1510

Logical Description of Context-free Graph Languages

Journal of Computer and System Sciences ◽

10.1006/jcss.1997.1510 ◽

1997 ◽

Vol 55 (3) ◽

pp. 489-503 ◽

Cited By ~ 17

Author(s):

Joost Engelfriet ◽

Vincent van Oostrom

Keyword(s):

Free Graph ◽

Logical Description ◽

Context Free ◽

Graph Languages

Download Full-text

On the decidability of integer subgraph problems on context-free graph languages

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-54458-5_86 ◽

1991 ◽

pp. 415-426 ◽

Cited By ~ 2

Author(s):

Egon Wanke

Keyword(s):

Free Graph ◽

Context Free ◽

Graph Languages

Download Full-text

Context-free graph languages of bounded degree are generated by apex graph grammars

Acta Informatica ◽

10.1007/bf01178511 ◽

1994 ◽

Vol 31 (4) ◽

pp. 341-378 ◽

Cited By ~ 12

Author(s):

Joost Engelfriet ◽

Linda Heyker ◽

George Leih

Keyword(s):

Graph Grammars ◽

Free Graph ◽

Bounded Degree ◽

Apex Graph ◽

Context Free ◽

Graph Languages

Download Full-text

Efficient decision procedures for graph properties on context-free graph languages

Journal of the ACM ◽

10.1145/151261.151268 ◽

1993 ◽

Vol 40 (2) ◽

pp. 368-393 ◽

Cited By ~ 11

Author(s):

Thomas Lengauer ◽

Egon Wanke

Keyword(s):

Decision Procedures ◽

Free Graph ◽

Graph Properties ◽

Context Free ◽

Graph Languages

Download Full-text

A pumping lemma for context-free graph languages

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

10.1007/bfb0025726 ◽

2005 ◽

pp. 270-283 ◽

Cited By ~ 14

Author(s):

Hans-Jörg Kreowski

Keyword(s):

Free Graph ◽

Pumping Lemma ◽

Context Free ◽

Graph Languages

Download Full-text

Efficient algorithms on context-free graph languages

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-19488-6_128 ◽

1988 ◽

pp. 362-378 ◽

Cited By ~ 23

Author(s):

Clemens Lautemann

Keyword(s):

Efficient Algorithms ◽

Free Graph ◽

Context Free ◽

Graph Languages

Download Full-text

The bounded tree-width problem of context-free graph languages

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0024506 ◽

1997 ◽

pp. 303-317

Author(s):

R. Skodinis

Keyword(s):

Free Graph ◽

Tree Width ◽

Context Free ◽

Graph Languages

Download Full-text

Regular Description of Context-free Graph Languages

Journal of Computer and System Sciences ◽

10.1006/jcss.1996.0087 ◽

1996 ◽

Vol 53 (3) ◽

pp. 556-574 ◽

Cited By ~ 6

Author(s):

Joost Engelfriet ◽

Vincent van Oostrom

Keyword(s):

Free Graph ◽

Context Free ◽

Graph Languages

Download Full-text

The complexity of connectivity problems on context-free graph languages

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-51498-8_46 ◽

1989 ◽

pp. 470-479 ◽

Cited By ~ 1

Author(s):

Egon Wanke

Keyword(s):

Free Graph ◽

Context Free ◽

Graph Languages

Download Full-text

On context-free graph languages generated by edge replacement

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

10.1007/bfb0000104 ◽

2005 ◽

pp. 143-158 ◽

Cited By ~ 16

Author(s):

Annegret Habel ◽

Hans -Jörg Kreowski

Keyword(s):

Free Graph ◽

Edge Replacement ◽

Context Free ◽

Graph Languages

Download Full-text

The complexity of connectivity problems on context-free graph languages

Journal of Computer and System Sciences ◽

10.1016/s0022-0000(05)80086-8 ◽

1994 ◽

Vol 49 (1) ◽

pp. 57-82

Author(s):

Egon Wanke

Keyword(s):

Free Graph ◽

Context Free ◽

Graph Languages

Download Full-text