On the number of linear partitions of the (m, n)-grid

DC Field	Value	Language
dc.contributor.author	Acketa, Dragan	en
dc.contributor.author	Žunić, Joviša	en
dc.date.accessioned	2020-05-01T20:29:04Z	-
dc.date.available	2020-05-01T20:29:04Z	-
dc.date.issued	1991-05-17	en
dc.identifier.issn	0020-0190	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1983	-
dc.description.abstract	A relationship between linear partitions and minimal pairs of a finite point set in the plane was established in [2]. This relationship is used here for counting the number of linear partitions of the set of points of the (m, n)-grid, a rectangular part of the infinite grid. In order to optimize this counting, an O(mn) algorithm is introduced for traversing all those pairs (i, j) of mutually simple natural numbers i and j, such that 1 ≤i≤m, 1≤j≤n.	en
dc.publisher	Elsevier	-
dc.relation.ispartof	Information Processing Letters	en
dc.subject	(m,n)-grids in the plane \| computational complexity \| Computational geometry \| linear partitions \| point sets	en
dc.title	On the number of linear partitions of the (m, n)-grid	en
dc.type	Article	en
dc.identifier.doi	10.1016/0020-0190(91)90240-I	en
dc.identifier.scopus	2-s2.0-0026157351	en
dc.relation.firstpage	163	en
dc.relation.lastpage	168	en
dc.relation.issue	3	en
dc.relation.volume	38	en
item.cerifentitytype	Publications	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.openairetype	Article	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-
crisitem.author.orcid	0000-0002-1271-4153	-

20

checked on Nov 19, 2024

24

checked on Nov 19, 2024

Check