Local Routing of Two-terminal Nets is Easy

Kaufmann, Michael; Mehlhorn, Kurt

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Report

Local Routing of Two-terminal Nets is Easy

MPS-Authors

/persons/resource/persons44745

Kaufmann, Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Kaufmann, M., & Mehlhorn, K.(1984). Local Routing of Two-terminal Nets is Easy (A 84/12). Saarbrücken: Universität des Saarlandes / Fachbereich Informatik.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0019-EFE9-2

Abstract

There is no abstract available