On metro-line crossing minimization

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Argyriou, E en
dc.contributor.author Bekos, MA en
dc.contributor.author Kaufmann, M en
dc.contributor.author Symvonis, A en
dc.date.accessioned 2014-03-01T01:34:01Z
dc.date.available 2014-03-01T01:34:01Z
dc.date.issued 2010 en
dc.identifier.issn 15261719 en
dc.identifier.uri http://hdl.handle.net/123456789/20642
dc.relation.uri http://www.scopus.com/inward/record.url?eid=2-s2.0-77955109095&partnerID=40&md5=a38f5ede106b196ad1918d7853e8eb95 en
dc.relation.uri http://emis.u-strasbg.fr/journals/JGAA/accepted/2010/ArgyriouBekosKaufmannSymvonis2010.14.1.pdf en
dc.relation.uri http://www.emis.de/journals/JGAA/accepted/2010/ArgyriouBekosKaufmannSymvonis2010.14.1.pdf en
dc.relation.uri http://jgaa.info/accepted/2010/ArgyriouBekosKaufmannSymvonis2010.14.1.pdf en
dc.relation.uri http://www.informatik.uni-trier.de/~ley/db/journals/jgaa/jgaa14.html#ArgyriouBKS10 en
dc.subject Optimal Solution en
dc.title On metro-line crossing minimization en
heal.type journalArticle en
heal.publicationDate 2010 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 depicts the structure of the underlying network, the nodes of G correspond to train stations, an edge connecting two nodes implies that there exists a railway track connecting them, whereas the paths illustrate the metro lines connecting terminal stations. We call this the metro-line crossing minimization problem (MLCM). We examine several variations of the problem for which we develop algorithms that yield optimal solutions. en
heal.journalName Journal of Graph Algorithms and Applications en
dc.identifier.volume 14 en
dc.identifier.issue 1 en
dc.identifier.spage 75 en
dc.identifier.epage 96 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