Eingang zum Volltext in SciDok
Lizenz
Report (Bericht) zugänglich unter
Routing through a generalized switchbox
URN: urn:nbn:de:bsz:291-scidok-41553
URL: http://scidok.sulb.uni-saarland.de/volltexte/2011/4155/
Quelle:
(1984) Saarbrücken, 1984
pdf-Format:
Dokument 1.pdf (8.785 KB)
Institut:
DDC-Sachgruppe:
Informatik
Dokumentart:
Report (Bericht)
Schriftenreihe:
Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes
Bandnummer:
1984/11
Sprache:
Englisch
Erstellungsjahr:
1984
Publikationsdatum:
02.09.2011
Kurzfassung auf Englisch:
We present an algorithm for the routing problem for two-terminal nets in generalized switchboxes. A generalized switchbox is any subset R of the planar rectangular grid with no non-trivial holes, i.e. every finite face has exactly four incident vertices. A net is a pair of nodes of non-maximal degree on the boundary of R. A solution is a set of edge-disjoint paths, one for each net. Our algorithm solves standard generalized switchbox routing problems in time O(n(log n)^2) where n is the number of vertices of R, i.e. it either finds a solution or indicates that there is none. A problem is standard if deg(v) + ter(v) is even for all vertices v where deg(v) is the degree of v and ter(v) is the number of nets which have v as a terminal. For nonstandard problems we can find a solution in time O(n(log n)^2 + |U|^2) where U is the set of vertices v with deg(v) + ter(v) is odd.
Lizenz:
Standard-Veröffentlichungsvertrag