| Naslov: | A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks |
|---|
| Avtorji: | ID Bokal, Drago (Avtor)
ID Brešar, Boštjan (Avtor)
ID Jerebic, Janja (Avtor) |
|---|
| Datoteke: |  http://www.imfm.si/preprinti/PDF/01102.pdf
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Delo ni kategorizirano |
|---|
| Organizacija: | FNM - Fakulteta za naravoslovje in matematiko
|
|---|
| Opis: | 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. |
|---|
| Ključne besede: | matematika, teorija grafov, prirejanje, kvazi prirejanje, polprirejanje, tok, madžarska metoda, mathematics, graph theory, matching, quasi-matching, semi-matching, flow, Hungarian method, augmenting path |
|---|
| Leto izida: | 2009 |
|---|
| Št. strani: | str. 1-15 |
|---|
| Številčenje: | Vol. 47, št. 1102 |
|---|
| PID: | 20.500.12556/DKUM-51803  |
|---|
| ISSN: | 1318-4865 |
|---|
| UDK: | 519.17:004 |
|---|
| COBISS.SI-ID: | 15306329 |
|---|
| NUK URN: | URN:SI:UM:DK:WZIKEP5L |
|---|
| Datum objave v DKUM: | 10.07.2015 |
|---|
| Število ogledov: | 1338 |
|---|
| Število prenosov: | 83 |
|---|
| Metapodatki: |    |
|---|
| Področja: | Ostalo
|
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
