Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/13986
DC FieldValueLanguage
dc.contributor.authorAcketa D.en
dc.contributor.authorŽunić J.en
dc.date.accessioned2020-03-03T14:54:27Z-
dc.date.available2020-03-03T14:54:27Z-
dc.date.issued1991-05-17en
dc.identifier.issn200190en
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/13986-
dc.description.abstractA 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.ispartofInformation Processing Lettersen
dc.titleOn the number of linear partitions of the (m, n)-griden
dc.typeJournal/Magazine Articleen
dc.identifier.doi10.1016/0020-0190(91)90240-Ien
dc.identifier.scopus2-s2.0-0026157351en
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/0026157351en
dc.relation.lastpage168en
dc.relation.firstpage163en
dc.relation.issue3en
dc.relation.volume38en
item.fulltextNo Fulltext-
item.grantfulltextnone-
Appears in Collections:PMF Publikacije/Publications
Show simple item record

SCOPUSTM   
Citations

20
checked on May 10, 2024

Page view(s)

9
Last Week
5
Last month
0
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.