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

TOTAL DOCUMENTS

26

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540522928, 9783540469506

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Toward a complete representation of graphoids in graphs — Abridged Version

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

10.1007/3-540-52292-1_4 ◽

1990 ◽

pp. 46-62

Author(s):

Robert Y. Geva ◽

Azaria Paz

Keyword(s):

Complete Representation

Download Full-text

On the complexity of optimal drawings of graphs

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

10.1007/3-540-52292-1_12 ◽

1990 ◽

pp. 166-180 ◽

Author(s):

Franz J. Brandenburg

Download Full-text

An O(n log n) algorithm for 1-D tile compaction

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

10.1007/3-540-52292-1_21 ◽

1990 ◽

pp. 287-301

Author(s):

Richard Anderson ◽

Simon Kahan ◽

Martine Schlag

Download Full-text

Improved self-reduction algorithms for graphs with bounded treewidth

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

10.1007/3-540-52292-1_17 ◽

1990 ◽

pp. 232-244 ◽

Author(s):

Hans L. Bodlaender

Keyword(s):

Bounded Treewidth

Download Full-text

k — Nearest — Neighbor Voronoi diagrams for sets of convex polygons, line segments and points

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

10.1007/3-540-52292-1_24 ◽

1990 ◽

pp. 330-340 ◽

Author(s):

Thomas Roos

Keyword(s):

Nearest Neighbor ◽

Voronoi Diagrams ◽

K Nearest Neighbor ◽

Convex Polygons ◽

Download Full-text

The complexity of graph problems for succinctly represented graphs

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

10.1007/3-540-52292-1_20 ◽

1990 ◽

pp. 277-286 ◽

Author(s):

Antonio Lozano ◽

José L. Balcázar

Keyword(s):

Download Full-text

Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry

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

10.1007/3-540-52292-1_23 ◽

1990 ◽

pp. 316-329

Author(s):

Frank Dehne ◽

Andrew Rau-Chaplin

Keyword(s):

Computational Geometry ◽

Data Structures

Download Full-text

Beyond Steiner's problem: A VLSI oriented generalization

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

10.1007/3-540-52292-1_14 ◽

1990 ◽

pp. 196-210 ◽

Author(s):

Gabriele Reich ◽

Peter Widmayer

Download Full-text

Describing distributed systems by categorical graph grammars

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

10.1007/3-540-52292-1_9 ◽

1990 ◽

pp. 121-135 ◽

Author(s):

H. J. Schneider

Keyword(s):

Distributed Systems ◽

Download Full-text

Graph rewriting systems with priorities

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

10.1007/3-540-52292-1_7 ◽

1990 ◽

pp. 94-106 ◽

Author(s):

Michel Billaud ◽

Pierre Lafon ◽

Yves Metivier ◽

Eric Sopena

Keyword(s):

Graph Rewriting ◽

Rewriting Systems ◽

Graph Rewriting Systems

Download Full-text