
The Library
Universal chains and wiring layouts
Tools
Paterson, Michael S. (1986) Universal chains and wiring layouts. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)
|
PDF
WRAP_cs-rr-074.pdf - Requires a PDF viewer. Download (7Mb) | Preview |
Abstract
A universal chain can be considered as a fixed schedule for a traveller's visits such that any set of m locations to be visited can be sequenced so that travelling times are accommodated within this schedule. Upper and lower bounds are proved for the lengths of universal chains in the unit interval, unit square and in higher dimensions. Applications to wiring layouts in circuit boards are presented.
Item Type: | Report | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
Library of Congress Subject Headings (LCSH): | Sequential machine theory | ||||
Series Name: | Department of Computer Science Research Report | ||||
Publisher: | University of Warwick. Department of Computer Science | ||||
Place of Publication: | Coventry, UK | ||||
Official Date: | April 1986 | ||||
Dates: |
|
||||
Number: | Number 74 | ||||
Number of Pages: | 10 | ||||
DOI: | CS-RR-074 | ||||
Institution: | University of Warwick | ||||
Theses Department: | Department of Computer Science | ||||
Status: | Not Peer Reviewed | ||||
Publication Status: | Unpublished | ||||
Reuse Statement (publisher, data, author rights): | M.S. Paterson, “Universal Chains and Wiring Layouts”, <i>SIAM Journal on Discrete Mathematics</i> <b>1</b>(1), pp. 80-85 (1988) | ||||
Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
![]() |
View Item |
Downloads
Downloads per month over past year