Please use this identifier to cite or link to this item:
|Title:||Drawing permutations with few corners|
Holroyd, A. E.
|Citation:||Drawing permutations with few corners / S. Bereg, A. E. Holroyd, L. Nachmanson, et al. — DOI 10.1007/978-3-319-03841-4_42 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2013. — Vol. 8242 LNCS. — P. 484-495.|
|Abstract:||A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is decomposed into nearest-neighbour transpositions. We address the problem of minimizing the number of crossings together with the number of corners of the paths, focusing on classes of permutations in which both can be minimized simultaneously. We give algorithms for computing such tangles for several classes of permutations. © 2013 Springer International Publishing Switzerland.|
MINIMIZING THE NUMBER OF
|Appears in Collections:||Научные публикации, проиндексированные в SCOPUS и WoS CC|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.