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

TOTAL DOCUMENTS

31

(FIVE YEARS 0)

H-INDEX

5

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540507284, 9783540460763

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Bandwidth and profile minimization

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

10.1007/3-540-50728-0_57 ◽

1989 ◽

pp. 378-393 ◽

Author(s):

Manfred Wiegers ◽

Burkhard Monien

Download Full-text

Fault tolerant networks of specified diameter

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

10.1007/3-540-50728-0_36 ◽

1989 ◽

pp. 74-86

Author(s):

H. Meijer ◽

R. Dawes

Keyword(s):

Download Full-text

Voronoi diagrams in the moscow metric

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

10.1007/3-540-50728-0_61 ◽

1989 ◽

pp. 434-441 ◽

Author(s):

Rolf Klein

Keyword(s):

Voronoi Diagrams

Download Full-text

On the estimate of the size of a directed graph

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

10.1007/3-540-50728-0_54 ◽

1989 ◽

pp. 317-326 ◽

Author(s):

A. Marchetti-Spaccamela

Keyword(s):

Download Full-text

O(n2) algorithms for graph planarization

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

10.1007/3-540-50728-0_56 ◽

1989 ◽

pp. 352-377 ◽

Author(s):

R. Jayakumar ◽

K. Thulasiraman ◽

M. N. S. Swamy

Keyword(s):

Graph Planarization

Download Full-text

Dominance in the presence of obstacles

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

10.1007/3-540-50728-0_43 ◽

1989 ◽

pp. 190-201 ◽

Author(s):

Mark T. Berg ◽

Mark H. Overmars

Download Full-text

On paths in search or decision trees which require almost worst-case time

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

10.1007/3-540-50728-0_59 ◽

1989 ◽

pp. 406-423

Author(s):

Ulrich Huckenbeck

Keyword(s):

Decision Trees ◽

Download Full-text

The average size of ordered binary subgraphs

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

10.1007/3-540-50728-0_55 ◽

1989 ◽

pp. 327-351

Author(s):

Pieter H. Hartel

Keyword(s):

Download Full-text

A simple systolic method to find all bridges of an undirected graph

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

10.1007/3-540-50728-0_49 ◽

1989 ◽

pp. 262-267 ◽

Author(s):

Manfred Schimmler ◽

Heiko Schröder

Keyword(s):

Undirected Graph

Download Full-text

Epsilon-nets for halfplanes

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

10.1007/3-540-50728-0_47 ◽

1989 ◽

pp. 243-252 ◽

Author(s):

Gerhart Woeginger

Keyword(s):

Download Full-text