| Title: | A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks |
|---|
| Authors: | ID Bokal, Drago (Author)
ID Brešar, Boštjan (Author)
ID Jerebic, Janja (Author) |
|---|
| Files: |  http://www.imfm.si/preprinti/PDF/01102.pdf
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Organization: | FNM - Faculty of Natural Sciences and Mathematics
|
|---|
| Abstract: | 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. |
|---|
| Keywords: | matematika, teorija grafov, prirejanje, kvazi prirejanje, polprirejanje, tok, madžarska metoda, mathematics, graph theory, matching, quasi-matching, semi-matching, flow, Hungarian method, augmenting path |
|---|
| Year of publishing: | 2009 |
|---|
| Number of pages: | str. 1-15 |
|---|
| Numbering: | Vol. 47, št. 1102 |
|---|
| PID: | 20.500.12556/DKUM-51803  |
|---|
| ISSN: | 1318-4865 |
|---|
| UDC: | 519.17:004 |
|---|
| COBISS.SI-ID: | 15306329 |
|---|
| NUK URN: | URN:SI:UM:DK:WZIKEP5L |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 1334 |
|---|
| Downloads: | 83 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
