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

TOTAL DOCUMENTS

25

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540551218, 9783540467359

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Tight bounds for the rectangular art gallery problem

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

10.1007/3-540-55121-2_10 ◽

1992 ◽

pp. 105-112 ◽

Author(s):

J. Czyzowicz ◽

E. Rivera-Campo ◽

N. Santoro ◽

J. Urrutia ◽

J. Zaks

Keyword(s):

Art Gallery ◽

Art Gallery Problem

Download Full-text

Fast parallel algorithms for coloring random graphs

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

10.1007/3-540-55121-2_13 ◽

1992 ◽

pp. 135-147

Author(s):

Zvi M. Kedem ◽

Krishna V. Palem ◽

Grammati E. Pantziou ◽

Paul G. Spirakis ◽

Christos D. Zaroliagis

Keyword(s):

Parallel Algorithms ◽

Download Full-text

The complexity of approximating the class Steiner tree problem

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

10.1007/3-540-55121-2_8 ◽

1992 ◽

pp. 85-96 ◽

Author(s):

Edmund Ihler

Keyword(s):

Steiner Tree ◽

Steiner Tree Problem

Download Full-text

Edge separators for graphs of bounded genus with applications

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

10.1007/3-540-55121-2_15 ◽

1992 ◽

pp. 159-168 ◽

Author(s):

Ondrej Sýkora ◽

Imrich Vrto

Download Full-text

Monadic second-order evaluations on tree-decomposable graphs

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

10.1007/3-540-55121-2_2 ◽

1992 ◽

pp. 13-24 ◽

Author(s):

B. Courcelle ◽

M. Mosbah

Keyword(s):

Second Order ◽

Decomposable Graphs

Download Full-text

A generalized encryption scheme based on random graphs

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

10.1007/3-540-55121-2_17 ◽

1992 ◽

pp. 180-186

Author(s):

Luděk Kučera

Keyword(s):

Random Graphs ◽

Encryption Scheme

Download Full-text

Line digraph iterations and the spread concept—with application to graph theory, fault tolerance, and routing

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

10.1007/3-540-55121-2_16 ◽

1992 ◽

pp. 169-179 ◽

Author(s):

Ding-Zhu Du ◽

Yuh-Dauh Lyuu ◽

D. Frank Hsu

Keyword(s):

Graph Theory ◽

Fault Tolerance ◽

Download Full-text

A language for generic graph-transformations

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

10.1007/3-540-55121-2_6 ◽

1992 ◽

pp. 63-74 ◽

Author(s):

Marc Andries ◽

Jan Paredaens

Keyword(s):

Graph Transformations

Download Full-text

Nondeterministic control structures for graph rewriting systems

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

10.1007/3-540-55121-2_5 ◽

1992 ◽

pp. 48-62 ◽

Author(s):

Albert Zündorf ◽

Andy Schürr

Keyword(s):

Graph Rewriting ◽

Control Structures ◽

Rewriting Systems ◽

Graph Rewriting Systems

Download Full-text

Optimal embedding of complete binary trees into lines and grids

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

10.1007/3-540-55121-2_3 ◽

1992 ◽

pp. 25-35 ◽

Author(s):

R. Heckmann ◽

R. Klasing ◽

B. Monien ◽

W. Unger

Keyword(s):

Download Full-text