An application of star polynomials to discrete random allocation problems

Authors

  • Farrell, Edward J.
  • Gargano, Michael L.
  • Quintas L.V.

Abstract

The star polynomial of a graph can be used to investigate certain models associated with random space filling problems -a type of allocation problem. In particular, various discrete forms of Renyi's Random Parking Problem (see Grimaldi [3], Renyi [4] and Rosen[5]) can be modeled by star covers of chains. There are also similar finite resource allocation problems in Computer Science which can be investigated, by means of star polynomials of graphs.

Published

2005-05-09

How to Cite

Farrell, Edward J., Gargano, Michael L., & Quintas L.V. (2005). An application of star polynomials to discrete random allocation problems. Utilitas Mathematica, 67. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/388

Issue

Vol. 67 (2005): Volume 67, 2005

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.