A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs

Authors:
Dorothea Wagner;Karsten Weihe
Affiliations:
-;-
Venue:
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Year:
1993

Citing 0
Cited 2

Approximations for the disjoint paths problem in high-diameter planar networks

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Models For Dependable Computation with Multiple Inputs and Some Hardness Results

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract