Geodesic

Tome 8 (2004) no. 3

Sommaire

On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
p. 241-273
Algorithms for Single Link Failure Recovery and Related Problems
p. 275-294
NP-Completeness of Minimal Width Unordered Tree Layout
p. 295-312
Algorithm and Experiments in Testing Planar Graphs for Isomorphism
p. 313-356
Three-Dimensional 1-Bend Graph Drawings
p. 357-366