Drawing permutations with few corners

Bereg, S.; Holroyd, A. E.; Nachmanson, L.; Pupyrev, S.

doi:10.1007/978-3-319-03841-4_42

Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс: http://elar.urfu.ru/handle/10995/102491

Полная запись метаданных

Поле DC	Значение	Язык
dc.contributor.author	Bereg, S.	en
dc.contributor.author	Holroyd, A. E.	en
dc.contributor.author	Nachmanson, L.	en
dc.contributor.author	Pupyrev, S.	en
dc.date.accessioned	2021-08-31T15:03:51Z	-
dc.date.available	2021-08-31T15:03:51Z	-
dc.date.issued	2013	-
dc.identifier.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.	en
dc.identifier.isbn	9783319038407	-
dc.identifier.issn	3029743	-
dc.identifier.other	Final	2
dc.identifier.other	All Open Access, Bronze, Green	3
dc.identifier.other	https://www.scopus.com/inward/record.uri?eid=2-s2.0-84891875301&doi=10.1007%2f978-3-319-03841-4_42&partnerID=40&md5=b646addce44ce6dafdbd337cf446041c
dc.identifier.other	https://link.springer.com/content/pdf/10.1007%2F978-3-319-03841-4_42.pdf	m
dc.identifier.uri	http://elar.urfu.ru/handle/10995/102491	-
dc.description.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.	en
dc.format.mimetype	application/pdf	en
dc.language.iso	en	en
dc.publisher	Springer Verlag	en
dc.rights	info:eu-repo/semantics/openAccess	en
dc.source	Lect. Notes Comput. Sci.	2
dc.source	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.subject	ARTIFICIAL INTELLIGENCE	en
dc.subject	COMPUTER SCIENCE	en
dc.subject	COMPUTERS	en
dc.subject	MINIMIZING THE NUMBER OF	en
dc.subject	NEAREST NEIGHBOUR	en
dc.subject	DRAWING (GRAPHICS)	en
dc.title	Drawing permutations with few corners	en
dc.type	Conference Paper	en
dc.type	info:eu-repo/semantics/conferenceObject	en
dc.type	info:eu-repo/semantics/publishedVersion	en
dc.identifier.doi	10.1007/978-3-319-03841-4_42	-
dc.identifier.scopus	84891875301	-
local.contributor.employee	Bereg, S., Department of Computer Science, University of Texas at Dallas, United States
local.contributor.employee	Holroyd, A.E., Microsoft Research, United States
local.contributor.employee	Nachmanson, L., Microsoft Research, United States
local.contributor.employee	Pupyrev, S., Department of Computer Science, University of Arizona, United States, Institute of Mathematics and Computer Science, Ural Federal University, Russian Federation
local.description.firstpage	484	-
local.description.lastpage	495	-
local.volume	8242 LNCS	-
local.contributor.department	Department of Computer Science, University of Texas at Dallas, United States
local.contributor.department	Microsoft Research, United States
local.contributor.department	Department of Computer Science, University of Arizona, United States
local.contributor.department	Institute of Mathematics and Computer Science, Ural Federal University, Russian Federation
local.identifier.pure	921600	-
local.identifier.pure	8ff3400a-7d9e-4cae-ba30-bf395412895e	uuid
local.identifier.eid	2-s2.0-84891875301	-
Располагается в коллекциях:	Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Файлы этого ресурса:

Файл	Описание	Размер	Формат
2-s2.0-84891875301.pdf		337,32 kB	Adobe PDF	Просмотреть/Открыть

Показать базовое описание ресурса Статистика Google Scholar

Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.