Maximizing the total resolution of graphs

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Argyriou, EN en
dc.contributor.author Bekos, MA en
dc.contributor.author Symvonis, A en
dc.date.accessioned 2014-03-01T02:53:21Z
dc.date.available 2014-03-01T02:53:21Z
dc.date.issued 2011 en
dc.identifier.issn 03029743 en
dc.identifier.uri http://hdl.handle.net/123456789/36254
dc.subject.other 2-layered drawing en
dc.subject.other Angular resolution en
dc.subject.other Asymptotically optimal en
dc.subject.other Complete bipartite graphs en
dc.subject.other Complete graphs en
dc.subject.other Edge crossing en
dc.subject.other Force-Directed en
dc.subject.other Graph drawing en
dc.subject.other Major factors en
dc.subject.other Drawing (graphics) en
dc.subject.other Optimization en
dc.subject.other Graph theory en
dc.title Maximizing the total resolution of graphs en
heal.type conferenceItem en
heal.identifier.primary 10.1007/978-3-642-18469-7_6 en
heal.identifier.secondary http://dx.doi.org/10.1007/978-3-642-18469-7_6 en
heal.publicationDate 2011 en
heal.abstract A major factor affecting the readability of a graph drawing is its resolution. In the graph drawing literature, the resolution of a drawing is either measured based on the angles formed by consecutive edges incident to a common node (angular resolution) or by the angles formed at edge crossings (crossing resolution). In this paper, we evaluate both by introducing the notion of ""total resolution"", that is, the minimum of the angular and crossing resolution. To the best of our knowledge, this is the first time where the problem of maximizing the total resolution of a drawing is studied. The main contribution of the paper consists of drawings of asymptotically optimal total resolution for complete graphs (circular drawings) and for complete bipartite graphs (2-layered drawings). In addition, we present and experimentally evaluate a force-directed based algorithm that constructs drawings of large total resolution. © 2011 Springer-Verlag. en
heal.journalName Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) en
dc.identifier.doi 10.1007/978-3-642-18469-7_6 en
dc.identifier.volume 6502 LNCS en
dc.identifier.spage 62 en
dc.identifier.epage 67 en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record