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

TOTAL DOCUMENTS

29
(FIVE YEARS 0)

H-INDEX

6
(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540427070, 9783540454779
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Lower Bounds for Algorithms for the Steiner Tree Problem

2001 ◽  
pp. 217-228 ◽  
Author(s):  
Clemens Gröpl ◽  
Stefan Hougardy ◽  
Till Nierhoff ◽  
Hans Jürgen Prömel
Keyword(s):  
Lower Bounds ◽  
Steiner Tree ◽  
Steiner Tree Problem

Small k-Dominating Sets in Planar Graphs with Applications

2001 ◽  
pp. 201-216 ◽  
Author(s):  
Cyril Gavoille ◽  
David Peleg ◽  
André Raspaud ◽  
Eric Sopena
Keyword(s):  
Planar Graphs ◽  
Dominating Sets

On Subfamilies of AT-Free Graphs

2001 ◽  
pp. 241-253
Author(s):  
Ekkehard Köhler ◽  
Derek G. Corneil ◽  
Stephan Olariu ◽  
Lorna Stewart
Load More ...
Sign in / Sign up

Export Citation Format

Share Document