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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540625599, 9783540680727

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Algebraic graph derivations for graphical calculi

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

10.1007/3-540-62559-3_19 ◽

1997 ◽

pp. 224-238 ◽

Cited By ~ 4

Author(s):

Wolfram Kahl

Download Full-text

Designing distrance-preserving fault-tolerant topologies

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

10.1007/3-540-62559-3_28 ◽

1997 ◽

pp. 352-366

Author(s):

Swamy K. Sitarama ◽

Abdol-Hossein Esfahanian

Keyword(s):

Fault Tolerant

Download Full-text

One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs

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

10.1007/3-540-62559-3_21 ◽

1997 ◽

pp. 254-267

Author(s):

Bettina Klinz ◽

Gerhard J. Woeginger

Keyword(s):

Network Flows ◽

Dynamic Network ◽

Dynamic Network Flows

Download Full-text

Definability equals recognizability of partial 3-trees

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

10.1007/3-540-62559-3_20 ◽

1997 ◽

pp. 239-253 ◽

Cited By ~ 5

Author(s):

Damon Kaller

Download Full-text

System diagnosis with smallest risk of error

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

10.1007/3-540-62559-3_13 ◽

1997 ◽

pp. 141-150 ◽

Cited By ~ 2

Author(s):

Krzysztof Diks ◽

Andrzej Pelc

Keyword(s):

System Diagnosis

Download Full-text

Closure properties of context-free Hyperedge Replacement Systems

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

10.1007/3-540-62559-3_10 ◽

1997 ◽

pp. 101-113

Author(s):

Ornella Ciotti ◽

Francesco Parisi-Presicce

Keyword(s):

Closure Properties ◽

Hyperedge Replacement ◽

Context Free

Download Full-text

Generalized edge-rankings of trees

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

10.1007/3-540-62559-3_31 ◽

1997 ◽

pp. 390-404 ◽

Cited By ~ 3

Author(s):

Xiao Zhou ◽

Md. Abul Kashem ◽

Takao Nishizeki

Download Full-text

On the hardness of allocating frequencies for hybrid networks

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

10.1007/3-540-62559-3_25 ◽

1997 ◽

pp. 308-322 ◽

Cited By ~ 1

Author(s):

Ewa Malesińska ◽

Alessandro Panconesi

Keyword(s):

Hybrid Networks

Download Full-text

Improved approximations of independent dominating set in bounded degree graphs

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

10.1007/3-540-62559-3_2 ◽

1997 ◽

pp. 2-16 ◽

Cited By ~ 1

Author(s):

Paola Alimonti ◽

Tiziana Calamoneri

Keyword(s):

Dominating Set ◽

Bounded Degree ◽

Bounded Degree Graphs ◽

Independent Dominating Set

Download Full-text

Efficient algorithms for shortest path queries in planar digraphs

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

10.1007/3-540-62559-3_14 ◽

1997 ◽

pp. 151-165 ◽

Cited By ~ 12

Author(s):

Hristo N. Djidjev

Keyword(s):

Shortest Path ◽

Efficient Algorithms ◽

Path Queries

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Algebraic graph derivations for graphical calculi

Designing distrance-preserving fault-tolerant topologies

One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs

Definability equals recognizability of partial 3-trees

System diagnosis with smallest risk of error

Closure properties of context-free Hyperedge Replacement Systems

Generalized edge-rankings of trees

On the hardness of allocating frequencies for hybrid networks

Improved approximations of independent dominating set in bounded degree graphs

Efficient algorithms for shortest path queries in planar digraphs

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