Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이상호 | * |
dc.date.accessioned | 2016-08-28T11:08:34Z | - |
dc.date.available | 2016-08-28T11:08:34Z | - |
dc.date.issued | 2000 | * |
dc.identifier.issn | 0925-7721 | * |
dc.identifier.other | OAK-597 | * |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/218734 | - |
dc.description.abstract | In this paper we present algorithms for drawing series parallel digraphs with as much symmetry as possible. The first step is to compute a certain kind of automorphism, called an "upward planar automorphism" for an input series parallel digraph. The next step uses these automorphisms to construct a symmetric drawing of the graph. We present several variations of the second step, with visibility drawings, "bus-orthogonal" drawings, and polyline drawings. All algorithms run in linear time. © 2000 Elsevier Science B.V. | * |
dc.language | English | * |
dc.title | Drawing series parallel digraphs symmetrically | * |
dc.type | Article | * |
dc.relation.issue | 3-4 | * |
dc.relation.volume | 17 | * |
dc.relation.index | SCIE | * |
dc.relation.index | SCOPUS | * |
dc.relation.startpage | 165 | * |
dc.relation.lastpage | 188 | * |
dc.relation.journaltitle | Computational Geometry: Theory and Applications | * |
dc.identifier.wosid | WOS:000166220700005 | * |
dc.identifier.scopusid | 2-s2.0-0347899516 | * |
dc.author.google | Hong S.-H. | * |
dc.author.google | Eades P. | * |
dc.author.google | Lee S.-H. | * |
dc.contributor.scopusid | 이상호(56812941400) | * |
dc.date.modifydate | 20240322133058 | * |