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

9783540578994, 9783540483854

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Graph ear decompositions and graph embeddings

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

10.1007/3-540-57899-4_67 ◽

1994 ◽

pp. 376-387 ◽

Cited By ~ 1

Author(s):

Jianer Chen ◽

Saroja P. Kanchi

Keyword(s):

Graph Embeddings

Download Full-text

Bounded tree-width and LOGCFL

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

10.1007/3-540-57899-4_39 ◽

1994 ◽

pp. 33-44 ◽

Cited By ~ 1

Author(s):

Egon Wanke

Keyword(s):

Tree Width

Download Full-text

Asteroidal triple-free graphs

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

10.1007/3-540-57899-4_54 ◽

1994 ◽

pp. 211-224 ◽

Cited By ~ 8

Author(s):

Derek. G. Corneil ◽

Stephan Olariu ◽

Lorna Stewart

Keyword(s):

Asteroidal Triple

Download Full-text

Improved bounds for the crossing numbers on surfaces of genus g

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

10.1007/3-540-57899-4_68 ◽

1994 ◽

pp. 388-395 ◽

Cited By ~ 2

Author(s):

Faxhad Shahrokhi ◽

Laszló A. Székely ◽

Ondrej Sýkora ◽

Imrich Vrt'o

Keyword(s):

Crossing Numbers

Download Full-text

Gossiping in vertex-disjoint paths mode in interconnection networks

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

10.1007/3-540-57899-4_60 ◽

1994 ◽

pp. 288-300 ◽

Cited By ~ 2

Author(s):

Juraj Hromkovič ◽

Ralf Klasing ◽

Elena A. Stöhr

Keyword(s):

Interconnection Networks ◽

Disjoint Paths ◽

Vertex Disjoint

Download Full-text

Average case analysis of fully dynamic connectivity for directed graphs

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

10.1007/3-540-57899-4_43 ◽

1994 ◽

pp. 87-98 ◽

Cited By ~ 1

Author(s):

Paola Alimonti ◽

Stefano Leonardi ◽

Alberto Marchetti-Spacccamela ◽

Xavier Messeguer

Keyword(s):

Directed Graphs ◽

Case Analysis ◽

Average Case Analysis ◽

Average Case ◽

Dynamic Connectivity

Download Full-text

On-line graph algorithms for incremental compilation

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

10.1007/3-540-57899-4_42 ◽

1994 ◽

pp. 70-86 ◽

Cited By ~ 4

Author(s):

Alberto Marchetti-Spaccamela ◽

Umberto Nanni ◽

Hans Rohnert

Keyword(s):

Graph Algorithms ◽

Line Graph ◽

Incremental Compilation ◽

On Line

Download Full-text

Algorithms and complexity of sandwich problems in graphs (extended abstract)

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

10.1007/3-540-57899-4_41 ◽

1994 ◽

pp. 57-69 ◽

Cited By ~ 1

Author(s):

Martin Charles Golumbic ◽

Haim Kaplan ◽

Ron Shamir

Keyword(s):

Algorithms And Complexity

Download Full-text

Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality

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

10.1007/3-540-57899-4_37 ◽

1994 ◽

pp. 11-20

Author(s):

N. W. Holloway ◽

S. Ravindran ◽

A. M. Gibbons

Keyword(s):

Triangle Inequality ◽

Minimum Weight ◽

Perfect Matchings ◽

Complete Graphs

Download Full-text

Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs

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

10.1007/3-540-57899-4_47 ◽

1994 ◽

pp. 132-143 ◽

Cited By ~ 8

Author(s):

Koichi Wada ◽

Kimio Kawaguchi

Keyword(s):

Efficient Algorithms ◽

Connected Graphs

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Graph ear decompositions and graph embeddings

Bounded tree-width and LOGCFL

Asteroidal triple-free graphs

Improved bounds for the crossing numbers on surfaces of genus g

Gossiping in vertex-disjoint paths mode in interconnection networks

Average case analysis of fully dynamic connectivity for directed graphs

On-line graph algorithms for incremental compilation

Algorithms and complexity of sandwich problems in graphs (extended abstract)

Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality

Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs

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