Line Crossing Minimization on Metro Maps

Bekos, M; Kaufmann, M; Potika, K; Symvonis, A

dc.contributor.author	Bekos, M	en
dc.contributor.author	Kaufmann, M	en
dc.contributor.author	Potika, K	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T02:50:58Z
dc.date.available	2014-03-01T02:50:58Z
dc.date.issued	2007	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/35261
dc.subject	Optimal Solution	en
dc.subject	Tree Network	en
dc.title	Line Crossing Minimization on Metro Maps	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-540-77537-9_24	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-77537-9_24	en
heal.publicationDate	2007	en
heal.abstract	We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V;E), so that the total number of crossings among pairs of paths is minimized. This problem arises when drawing metro maps, where the embedding of G de- picts the structure of the underlying network, the nodes of G correspond	en
heal.journalName	Symposium on Graph Drawing	en
dc.identifier.doi	10.1007/978-3-540-77537-9_24	en