Please use this identifier to cite or link to this item: doi:10.22028/D291-26115
Title: Local routing of two-terminal nets is easy (extended abstract)
Author(s): Kaufmann, Michael
Mehlhorn, Kurt
Language: English
Year of Publication: 1984
OPUS Source: Saarbrücken, 1984
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: A local routing problem is given by a routing region (a subgraph of the planer grid) and a set of nets. For each net a global routing is also given. The problem is to find a local routing which is consistent with the global routing (if there is one). In this paper we show that local routing problems can be sloved in time O(n(log n)2).
Link to this record: urn:nbn:de:bsz:291-scidok-41563
Series name: Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes
Series volume: 1984/12
Date of registration: 2-Sep-2011
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fb14_1984_12.pdf3,38 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.