Please use this identifier to cite or link to this item: doi:10.22028/D291-26113
Title: Algorithms for routing in planar graphs
Author(s): Becker, Michael
Mehlhorn, Kurt
Language: English
Year of Publication: 1984
OPUS Source: Saarbrücken, 1984
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: We present algorithms for solving routing problems for two-terminal nets in planar graphs. Our algorithms run in time O(n2) for general planar graphs and in time O(bn) for grid graphs where n is the number of vertices and b is the number of vertices on the boundary of the infinite face.
Link to this record: urn:nbn:de:bsz:291-scidok-41523
Series name: Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes
Series volume: 1984/07
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_07.pdf3,7 MBAdobe PDFView/Open

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