Block allocation of a sequential resource

Scientific paper - Original scientific paper

• Author: Tomislav Došlić
• Author's institution: University 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): maximal matching; maximal packing
• Language: english
• Publication type: Scientific paper - Original scientific paper
• Publication status: Published
• Peer review: Peer review - international
• Publication version: Published version
• Journal title: ARS Mathematica Contemporanea
• Numbering: vol. 17, pp. 79-88
• e-ISSN: 1855-3974
• URN:NBN: urn:nbn:hr:237:017055
• Publication: 2019
• Type of resource: Text
• Access conditions: Open access
• Created on: 2024-09-04 07:18:13