Algorithms—ESA '93 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

38
(FIVE YEARS 0)

H-INDEX

8
(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540572732, 9783540480327
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Computing treewidth and minimum fill-in: All you need are the minimal separators

1993 ◽  
pp. 260-271 ◽  
Author(s):  
T. Kloks ◽  
H. Bodlaender ◽  
H. Müller ◽  
D. Kratsch

The complexity of scheduling trees with communication delays

1993 ◽  
pp. 284-294 ◽  
Author(s):  
Jan Karel Lenstra ◽  
Marinus Veldhorst ◽  
Bart Veltman
Keyword(s):  
Communication Delays

Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs

1993 ◽  
pp. 200-211 ◽  
Author(s):  
Juraj Hromkovič ◽  
Ralf Klasing ◽  
Elena A. Stöhr ◽  
Hubert Wagener
Keyword(s):  
Planar Graphs ◽  
Disjoint Paths ◽  
Vertex Disjoint

A linear algorithm for edge-coloring partial k-trees

1993 ◽  
pp. 409-418 ◽  
Author(s):  
Xiao Zhou ◽  
Shin-ichi Nakano ◽  
Takao Nishizeki
Keyword(s):  
Edge Coloring ◽  
Linear Algorithm

A calculus of random generation

1993 ◽  
pp. 169-180 ◽  
Author(s):  
Philippe Flajolet ◽  
Paul Zimmermann ◽  
Bernard Cutsem
Keyword(s):  
Random Generation
Load More ...
Sign in / Sign up

Export Citation Format

Share Document