Maximizing the Total Resolution of Graphs

Argyriou, E; Bekos, M; Symvonis, A

dc.contributor.author	Argyriou, E	en
dc.contributor.author	Bekos, M	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T01:59:19Z
dc.date.available	2014-03-01T01:59:19Z
dc.date.issued	2010	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/28922
dc.subject	Asymptotic Optimality	en
dc.subject	Complete Bipartite Graph	en
dc.subject	Complete Graph	en
dc.subject	Experimental Evaluation	en
dc.subject	Graph Drawing	en
dc.title	Maximizing the Total Resolution of Graphs	en
heal.type	journalArticle	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	2010	en
heal.abstract	A major factor affecting the readability of a graph drawing is itsresolution. In the graph drawing literature, the resolution of a drawing iseither measured based on the angles formed by consecutive edges incident to acommon node (angular resolution) or by the angles formed at edge crossings(crossing resolution). In this paper, we evaluate both by introducing the	en
heal.journalName	Computing Research Repository	en
dc.identifier.doi	10.1007/978-3-642-18469-7_6	en