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

TOTAL DOCUMENTS

30

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540606185, 9783540484875

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Sub-cubic cost algorithms for the all pairs shortest path problem

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

10.1007/3-540-60618-1_86 ◽

1995 ◽

pp. 333-343

Author(s):

Tadao Takaoka

Keyword(s):

Shortest Path ◽

Shortest Path Problem ◽

All Pairs Shortest Path

Download Full-text

Hot-potato routing on multi-dimensional tori

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

10.1007/3-540-60618-1_77 ◽

1995 ◽

pp. 209-221 ◽

Author(s):

Friedhelm Meyer ◽

Matthias Westermann

Download Full-text

The malleability of TSP 2Opt

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

10.1007/3-540-60618-1_73 ◽

1995 ◽

pp. 152-166 ◽

Author(s):

Sophie Fischer ◽

Leen Torenvliet

Download Full-text

On Interval Routing Schemes and treewidth

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

10.1007/3-540-60618-1_75 ◽

1995 ◽

pp. 181-196 ◽

Author(s):

Hans L. Bodlaender ◽

Richard B. Tann ◽

Dimitris M. Thilikos ◽

Jan Leeuwen

Keyword(s):

Routing Schemes ◽

Interval Routing

Download Full-text

Homogeneously orderable graphs and the Steiner tree problem

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

10.1007/3-540-60618-1_90 ◽

1995 ◽

pp. 381-395

Author(s):

Andreas Brandstädt ◽

Feodor F. Dragan ◽

Falk Nicolai

Keyword(s):

Steiner Tree ◽

Steiner Tree Problem

Download Full-text

Modular decomposition of hypergraphs

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

10.1007/3-540-60618-1_84 ◽

1995 ◽

pp. 303-317

Author(s):

P. Bonizzoni ◽

G. Vedova

Keyword(s):

Modular Decomposition

Download Full-text

A uniform approach to graph rewriting: The pullback approach

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

10.1007/3-540-60618-1_69 ◽

1995 ◽

pp. 101-115 ◽

Author(s):

Michel Bauderon

Keyword(s):

Graph Rewriting ◽

Uniform Approach

Download Full-text

Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs

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

10.1007/3-540-60618-1_76 ◽

1995 ◽

pp. 197-208

Author(s):

Koichi Wada ◽

Takaharu Ikeo ◽

Kimio Kawaguchi ◽

Wei Chen

Keyword(s):

Fault Tolerant ◽

Generalized Hypercube

Download Full-text

Graph-theoretical methods to construct entity-relationship databases

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

10.1007/3-540-60618-1_71 ◽

1995 ◽

pp. 131-145 ◽

Author(s):

Sven Hartmann

Keyword(s):

Theoretical Methods ◽

Entity Relationship

Download Full-text

Planarization of graphs embedded on surfaces

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

10.1007/3-540-60618-1_66 ◽

1995 ◽

pp. 62-72 ◽

Author(s):

Hristo N. Djidjev ◽

Shankar M. Venkatesan

Download Full-text