prikaz prve stranice dokumenta Block allocation of a sequential resource
  Download
PDF 248.59 KB
Scientific paper - Original scientific paper
Block allocation of a sequential resource
ARS Mathematica Contemporanea, 17 (2019); 79-88. urn:nbn:hr:237:017055
Došlić, Tomislav

Institutional repository: Repository of the Faculty of Civil Engineering, University of Zagreb

Cite this document

Došlić, T. (2019). Block allocation of a sequential resource. ARS Mathematica Contemporanea, 17., 79-88. Retrieved from https://urn.nsk.hr/urn:nbn:hr:237:017055

Došlić, Tomislav. "Block allocation of a sequential resource." ARS Mathematica Contemporanea, vol. 17, 2019, pp. 79-88. https://urn.nsk.hr/urn:nbn:hr:237:017055

Došlić, Tomislav. "Block allocation of a sequential resource." ARS Mathematica Contemporanea 17 (2019): 79-88. https://urn.nsk.hr/urn:nbn:hr:237:017055

Došlić, T. (2019) 'Block allocation of a sequential resource', ARS Mathematica Contemporanea, 17, pp. 79-88. Available at: https://urn.nsk.hr/urn:nbn:hr:237:017055 (Accessed 27 December 2024)

Došlić T. Block allocation of a sequential resource. ARS Mathematica Contemporanea [Internet]. 2019 [cited 2024 December 27];17:79-88. Available at: https://urn.nsk.hr/urn:nbn:hr:237:017055

T. Došlić, "Block allocation of a sequential resource", ARS Mathematica Contemporanea, vol. 17, pp. 79-88, 2019. [Online]. Available at: https://urn.nsk.hr/urn:nbn:hr:237:017055. [Accessed: 27 December 2024]

Metadata
Title (english)Block allocation of a sequential resource
AuthorTomislav Došlić
Author's institutionUniversity of Zagreb
Faculty of Civil Engineering
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Civil Engineering
Abstract (english)
An H-packing of G is a collection of vertex-disjoint subgraphs of G such that each component is isomorphic to H. An H-packing of G is maximal if it cannot be extended to a larger H-packing of G. In this paper we consider problem of random allocation of a sequential resource into blocks of m consecutive units and show how it can be successfully modeled in terms of maximal Pm-packings. We enumerate maximal Pm-packings of Pn of a given cardinality and determine the asymptotic behavior of the enumerating sequences. We also compute the expected size of m-packings and provide a lower bound on the efficiency of block-allocation.
Keywords (english)
Languageenglish
Publication typeScientific paper - Original scientific paper
Publication statusPublished
Peer reviewPeer review - international
Publication versionPublished version
Journal titleARS Mathematica Contemporanea
Numberingvol. 17, pp. 79-88
e-ISSN1855-3974
URN:NBNurn:nbn:hr:237:017055
Publication2019
Type of resourceText
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2024-09-04 07:18:13