Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/13986
Nаziv: | On the number of linear partitions of the (m, n)-grid | Аutоri: | Acketa D. Žunić J. |
Dаtum izdаvаnjа: | 17-мај-1991 | Čаsоpis: | Information Processing Letters | Sažetak: | 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 |
Nаlаzi sе u kоlеkciјаmа: | PMF Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
20
prоvеrеnо 10.05.2024.
Prеglеd/i stаnicа
9
Prоtеklа nеdеljа
5
5
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.