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

TOTAL DOCUMENTS

30
(FIVE YEARS 0)

H-INDEX

4
(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540651956, 9783540494942
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Splitting Number is NP-Complete

1998 ◽  
pp. 285-297 ◽  
Author(s):  
L. Faria ◽  
C. M. H. de Figueiredo ◽  
C. F. X. Mendonça
Keyword(s):  
Splitting Number ◽  
Np Complete

A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees

1998 ◽  
pp. 100-113
Author(s):  
Shuji Isobe ◽  
Xiao Zhou ◽  
Takao Nishizeki
Keyword(s):  
Polynomial Time ◽  
Polynomial Time Algorithm ◽  
Time Algorithm

Integral Uniform Flows in Symmetric Networks

1998 ◽  
pp. 272-284
Author(s):  
Farhad Shahrokhi ◽  
László A. Székely
Keyword(s):  
Symmetric Networks

Upgrading Bottleneck Constrained Forests

1998 ◽  
pp. 215-226
Author(s):  
S. O. Krumke ◽  
M. V. Marathe ◽  
H. Noltemeier ◽  
S. S. Ravi ◽  
H. -C. Wirth

Efficient Embeddings of Grids into Grids

1998 ◽  
pp. 257-271 ◽  
Author(s):  
Markus Röttger ◽  
Ulf-Peter Schroeder

Tree Spanners in Planar Graphs

1998 ◽  
pp. 298-309 ◽  
Author(s):  
Sándor P. Fekete ◽  
Jana Kremer
Keyword(s):  
Planar Graphs

Compact Implicit Representation of Graphs

1998 ◽  
pp. 164-176 ◽  
Author(s):  
Maurizio Talamo ◽  
Paola Vocca
Keyword(s):  
Implicit Representation

Domination and Steiner Tree Problems on Graphs with Few P 4s

1998 ◽  
pp. 337-350 ◽  
Author(s):  
Luitpold Babel ◽  
Stephan Olariu
Keyword(s):  
Steiner Tree ◽  
Steiner Tree Problems

scholarly journals Diameter Determination on Restricted Graph Families

1998 ◽  
pp. 192-202 ◽  
Author(s):  
Derek G. Corneil ◽  
Feodor F. Dragan ◽  
Michel Habib ◽  
Christophe Paul
Keyword(s):  
Graph Families
Load More ...
Sign in / Sign up

Export Citation Format

Share Document