VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks [Elektronski vir]
    Bokal, Drago, 1978- ; Brešar, Boštjan ; Jerebic, Janja
    In this paper, we consider various problems concerning quasi-matchings and semi-matchings in bipartite graphs, which generalize the classical problem of determining a perfect matching in bipartite ... graphs. We prove a vast generalization of Hall's marriage theorem, and present an algorithm that solves the problem of determining a lexicographically minimum ▫$g$▫-quasi-matching (that is a set ▫$F$▫ of edges in a bipartite graph such that in one set of the bipartition every vertex v has at least ▫$g(v)$▫ incident edges from ▫$F$▫, where ▫$g$▫ is a so-called need mapping, while on the other side of the bipartition the distribution of degrees with respect to ▫$F$▫ is lexicographically minimum). We also present an application in designing an optimal CDMA-based wireless sensor networks.
    Vir: Preprint series. - ISSN 1318-4865 (Vol. 47, št. 1102, 2009, str. 1-15)
    Vrsta gradiva - e-članek
    Leto - 2009
    Jezik - angleški
    COBISS.SI-ID - 15306329

    Povezava(-e):

    http://www.imfm.si/preprinti/PDF/01102.pdf
    Digitalna knjižnica Univerze v Mariboru – DKUM

Vnos na polico