Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/13986
Title: | On the number of linear partitions of the (m, n)-grid | Authors: | Acketa D. Žunić J. |
Issue Date: | 17-May-1991 | Journal: | Information Processing Letters | 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. | URI: | https://open.uns.ac.rs/handle/123456789/13986 | ISSN: | 200190 | DOI: | 10.1016/0020-0190(91)90240-I |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
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.