Journal of Graph Algorithms and Applications, Tome 2 (1998)

Geodesic

Parcourir par

Sommaire du Fascicule no. 1

Algorithms for Cluster Busting in Anchored Graph Drawing

Kelly Lyons ; Henk Meijer ; David Rappaport

p. 1-24

Sommaire du Fascicule no. 2

A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs

Leqiang Bai ; Hajime Maeda ; Hiroyuki Ebara ; Hideo Nakano

p. 1-17

Sommaire du Fascicule no. 3

A Visibility Representation for Graphs in Three Dimensions

Prosenjit Bose ; Hazel Everett ; Sándor Fekete ; Michael Houle ; Anna Lubiw ; Henk Meijer ; Kathleen Romanik ; Günter Rote ; Thomas Shermer ; Sue Whitesides ; Christian Zelle

p. 1-16

Sommaire du Fascicule no. 4

Scheduled Hot-Potato Routing

Joseph(Seffi) Naor ; Ariel Orda ; Raphael Rom

p. 1-20

Sommaire du Fascicule no. 5

Treewidth and Minimum Fill-in on d-Trapezoid Graphs

Hans Bodlaender ; Ton Kloks ; Dieter Kratsch ; Haiko Müller

p. 1-23

Sommaire du Fascicule no. 6

Memory Paging for Connectivity and Path Problems in Graphs

Esteban Feuerstein ; Alberto Marchetti-Spaccamela

p. 1-22

Sommaire du Fascicule no. 7

New Lower Bounds For Orthogonal Drawings

Therese Biedl

p. 1-31

Sommaire du Fascicule no. 8

Rectangle-visibility Layouts of Unions and Products of Trees

Alice Dean ; Joan Hutchinson

p. 1-21