Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/13986
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Acketa D. | en |
dc.contributor.author | Žunić J. | en |
dc.date.accessioned | 2020-03-03T14:54:27Z | - |
dc.date.available | 2020-03-03T14:54:27Z | - |
dc.date.issued | 1991-05-17 | en |
dc.identifier.issn | 200190 | en |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/13986 | - |
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. © 1991. | en |
dc.relation.ispartof | Information Processing Letters | en |
dc.title | On the number of linear partitions of the (m, n)-grid | en |
dc.type | Journal/Magazine Article | en |
dc.identifier.doi | 10.1016/0020-0190(91)90240-I | en |
dc.identifier.scopus | 2-s2.0-0026157351 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/0026157351 | en |
dc.relation.lastpage | 168 | en |
dc.relation.firstpage | 163 | en |
dc.relation.issue | 3 | en |
dc.relation.volume | 38 | en |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
Appears in Collections: | PMF Publikacije/Publications |
SCOPUSTM
Citations
20
checked on May 10, 2024
Page view(s)
9
Last Week
5
5
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.