First steps in combinatorial optimization on graphons: matchings

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F17%3A00477079" target="_blank" >RIV/67985807:_____/17:00477079 - isvavai.cz</a>
Alternative codes found
RIV/67985840:_____/17:00477079
Result on the web
<a href="http://dx.doi.org/10.1016/j.endm.2017.06.060" target="_blank" >http://dx.doi.org/10.1016/j.endm.2017.06.060</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.endm.2017.06.060" target="_blank" >10.1016/j.endm.2017.06.060</a>

Result language
angličtina
Original language name
First steps in combinatorial optimization on graphons: matchings
Original language description
Much of discrete optimization concerns problems whose underlying structures are graphs. Here, we translate the theory around the maximum matching problem to the setting of graphons. We study continuity properties of the thus defined matching ratio, limit versions of matching polytopes and vertex cover polytopes, and deduce a version of the LP duality for the problem of maximum fractional matching in the graphon setting.
Czech name
—
Czech description
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)