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

TOTAL DOCUMENTS

28

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540411833, 9783540400646

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables

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

10.1007/3-540-40064-8_28 ◽

2000 ◽

pp. 302-313

Author(s):

Koichi Wada ◽

Wei Chen

Keyword(s):

Fault Tolerant ◽

Connected Graphs ◽

Download Full-text

The Expressive Power and Complexity of Dynamic Process Graphs

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

10.1007/3-540-40064-8_22 ◽

2000 ◽

pp. 230-242 ◽

Author(s):

Andreas Jakoby ◽

Maciej LiŚkiewicz ◽

Rüdiger Reischuk

Keyword(s):

Dynamic Process ◽

Expressive Power ◽

Download Full-text

Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults

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

10.1007/3-540-40064-8_14 ◽

2000 ◽

pp. 137-148 ◽

Author(s):

Stefan Dobrev

Keyword(s):

Dynamic Faults ◽

Input Multiplicity

Download Full-text

Optimizing Cost Flows by Modifying Arc Costs and Capacities

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

10.1007/3-540-40064-8_12 ◽

2000 ◽

pp. 116-126

Author(s):

Ingo Demgensky ◽

Hartmut Noltemeier ◽

Hans-Christoph Wirth

Download Full-text

New Spectral Lower Bounds on the Bisection Width of Graphs

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

10.1007/3-540-40064-8_4 ◽

2000 ◽

pp. 23-34 ◽

Author(s):

Sergei L. Bezrukov ◽

Robert Elsässer ◽

Burkhard Monien ◽

Robert Preis ◽

Jean-Pierre Tillich

Keyword(s):

Lower Bounds ◽

Bisection Width

Download Full-text

A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs

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

10.1007/3-540-40064-8_27 ◽

2000 ◽

pp. 290-301 ◽

Author(s):

Sayaka Nagai ◽

Shin-ichi Nakano

Keyword(s):

Planar Graphs ◽

Spanning Trees ◽

Linear Time ◽

Time Algorithm ◽

Linear Time Algorithm ◽

Independent Spanning Trees

Download Full-text

Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs

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

10.1007/3-540-40064-8_9 ◽

2000 ◽

pp. 83-94 ◽

Author(s):

Edson Cáceres ◽

Albert Chan ◽

Frank Dehne ◽

Giuseppe Prencipe

Keyword(s):

Parallel Algorithms ◽

Bipartite Graphs ◽

Coarse Grained ◽

Convex Bipartite Graphs

Download Full-text

Bandwidth of Split and Circular Permutation Graphs

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

10.1007/3-540-40064-8_23 ◽

2000 ◽

pp. 243-254 ◽

Author(s):

Ton Kloks ◽

Dieter Kratsch ◽

Yvan Le Borgne ◽

Haiko Müller

Keyword(s):

Circular Permutation ◽

Permutation Graphs

Download Full-text

Recognizing Graphs without Asteroidal Triples (Extended Abstract)

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

10.1007/3-540-40064-8_24 ◽

2000 ◽

pp. 255-266

Author(s):

Ekkehard Köhler

Download Full-text

Approximating the Treewidth of AT-Free Graphs

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

10.1007/3-540-40064-8_7 ◽

2000 ◽

pp. 59-70

Author(s):

Vincent Bouchitté ◽

Ioan Todinca

Download Full-text