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

TOTAL DOCUMENTS

35
(FIVE YEARS 0)

H-INDEX

8
(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

1994 ◽  
pp. 376-387 ◽  
Author(s):  
Jianer Chen ◽  
Saroja P. Kanchi
Keyword(s):  
Graph Embeddings

Bounded tree-width and LOGCFL

1994 ◽  
pp. 33-44 ◽  
Author(s):  
Egon Wanke
Keyword(s):  
Tree Width

Asteroidal triple-free graphs

1994 ◽  
pp. 211-224 ◽  
Author(s):  
Derek. G. Corneil ◽  
Stephan Olariu ◽  
Lorna Stewart
Keyword(s):  
Asteroidal Triple

Improved bounds for the crossing numbers on surfaces of genus g

1994 ◽  
pp. 388-395 ◽  
Author(s):  
Faxhad Shahrokhi ◽  
Laszló A. Székely ◽  
Ondrej Sýkora ◽  
Imrich Vrt'o
Keyword(s):  
Crossing Numbers

Gossiping in vertex-disjoint paths mode in interconnection networks

1994 ◽  
pp. 288-300 ◽  
Author(s):  
Juraj Hromkovič ◽  
Ralf Klasing ◽  
Elena A. Stöhr
Keyword(s):  
Interconnection Networks ◽  
Disjoint Paths ◽  
Vertex Disjoint

Average case analysis of fully dynamic connectivity for directed graphs

1994 ◽  
pp. 87-98 ◽  
Author(s):  
Paola Alimonti ◽  
Stefano Leonardi ◽  
Alberto Marchetti-Spacccamela ◽  
Xavier Messeguer
Keyword(s):  
Directed Graphs ◽  
Case Analysis ◽  
Average Case Analysis ◽  
Average Case ◽  
Dynamic Connectivity

On-line graph algorithms for incremental compilation

1994 ◽  
pp. 70-86 ◽  
Author(s):  
Alberto Marchetti-Spaccamela ◽  
Umberto Nanni ◽  
Hans Rohnert
Keyword(s):  
Graph Algorithms ◽  
Line Graph ◽  
Incremental Compilation ◽  
On Line

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

1994 ◽  
pp. 57-69 ◽  
Author(s):  
Martin Charles Golumbic ◽  
Haim Kaplan ◽  
Ron Shamir
Keyword(s):  
Algorithms And Complexity
Load More ...
Sign in / Sign up

Export Citation Format

Share Document