Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

32

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540590712, 9783540491835

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Fugitive-search games on graphs and related parameters

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

10.1007/3-540-59071-4_59 ◽

1995 ◽

pp. 331-342 ◽

Author(s):

Nick D. Dendris ◽

Lefteris M. Kirousis ◽

Dimitris M. Thilikos

Keyword(s):

Search Games ◽

Games On Graphs

Download Full-text

Specification of graph translators with triple graph grammars

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

10.1007/3-540-59071-4_45 ◽

1995 ◽

pp. 151-163 ◽

Author(s):

Andy Schürr

Keyword(s):

Graph Grammars ◽

Triple Graph Grammars

Download Full-text

Labelled trees and pairs of input-output permutations in priority queues

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

10.1007/3-540-59071-4_55 ◽

1995 ◽

pp. 282-291

Author(s):

M. Golin ◽

S. Zaks

Keyword(s):

Priority Queues ◽

Input Output ◽

Download Full-text

Measuring the distance to series-parallelity by path expressions

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

10.1007/3-540-59071-4_54 ◽

1995 ◽

pp. 269-281 ◽

Author(s):

Valeska Naumann

Download Full-text

Cartesian products of graphs as spanning subgraphs of de Bruijn graphs

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

10.1007/3-540-59071-4_44 ◽

1995 ◽

pp. 140-150

Author(s):

Thomas Andreae ◽

Michael Nölle ◽

Gerald Schreiber

Keyword(s):

Cartesian Products ◽

De Bruijn Graphs ◽

Spanning Subgraphs ◽

De Bruijn ◽

Cartesian Products Of Graphs

Download Full-text

Domino treewidth

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

10.1007/3-540-59071-4_33 ◽

1995 ◽

pp. 1-13 ◽

Author(s):

Hans L. Bodlaender ◽

Joost Engelfriet

Download Full-text

New lower bounds and hierarchy results for restricted branching programs

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

10.1007/3-540-59071-4_61 ◽

1995 ◽

pp. 359-370 ◽

Author(s):

Detlef Sieling ◽

Ingo Wegener

Keyword(s):

Lower Bounds ◽

Branching Programs

Download Full-text

Complexity of graph covering problems

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

10.1007/3-540-59071-4_40 ◽

1995 ◽

pp. 93-105 ◽

Author(s):

Jan Kratochvíl ◽

Andrzej Proskurowski ◽

Jan Arne Telle

Keyword(s):

Covering Problems ◽

Download Full-text

A lower bound for treewidth and its consequences

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

10.1007/3-540-59071-4_34 ◽

1995 ◽

pp. 14-25 ◽

Author(s):

Siddharthan Ramachandramurthi

Keyword(s):

Download Full-text

Prefix graphs and their applications

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

10.1007/3-540-59071-4_49 ◽

1995 ◽

pp. 206-218 ◽

Author(s):

Shiva Chaudhuri ◽

Torben Hagerup

Download Full-text