Efficient drawing of partially oriented planar graphs with application to the circuit layout problem
dc.creator | Hanna, James Arthur | |
dc.date.accessioned | 2016-11-14T23:26:28Z | |
dc.date.available | 2011-02-18T21:58:44Z | |
dc.date.available | 2016-11-14T23:26:28Z | |
dc.date.issued | 1985-05 | |
dc.degree.department | Computer Science | en_US |
dc.description.abstract | Not available | |
dc.format.mimetype | application/pdf | |
dc.identifier.uri | http://hdl.handle.net/2346/17318 | en_US |
dc.language.iso | eng | |
dc.publisher | Texas Tech University | en_US |
dc.rights.availability | Unrestricted. | |
dc.subject | Computers -- Circuits | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Computer graphics | en_US |
dc.subject | Trees (Graph theory) | en_US |
dc.subject | Graph theory | en_US |
dc.title | Efficient drawing of partially oriented planar graphs with application to the circuit layout problem | |
dc.type | Thesis |