Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Márton Makai"'
Autor:
Márton Makai
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AE,..., Iss Proceedings (2005)
Let $H=(V,E)$ be a hypergraph and let $k≥ 1$ and$ l≥ 0$ be fixed integers. Let $\mathcal{M}$ be the matroid with ground-set $E s.t. a$ set $F⊆E$ is independent if and only if each $X⊆V$ with $k|X|-l≥ 0$ spans at most $k|X|-l$ hyperedges of
Externí odkaz:
https://doaj.org/article/cac2327cd8994c238f5276dcf30d9cac
Autor:
Jácint Szabó, Márton Makai
Publikováno v:
Combinatorica. 28:679-692
According to the present state of the theory of the matroid parity problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of certain substructures, called double circuits. In this paper we prove th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d36fff619f2eba911b5677266f833fd
https://doi.org/10.1007/s00493-008-2374-1
https://doi.org/10.1007/s00493-008-2374-1
Autor:
Márton Makai
Publikováno v:
Applied Mathematics and Computation. 150:785-801
The paper deals with the reroute sequence planning in telecommunication networks. Initially, we are given communication requests between terminal pairs and a path system which is able to satisfy these demands while respecting the physical link capaci
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca6a8d9bf2e037b2d3c447dae3654f01
https://doi.org/10.1016/s0096-3003(03)00307-2
https://doi.org/10.1016/s0096-3003(03)00307-2
Autor:
Balázs Gábor Józsa, Márton Makai
Publikováno v:
Computer Networks. 42:199-210
This paper studies the problem of reroute sequence planning for label switched paths (LSPs) in multiprotocol label switching networks from both the theoretical and practical points of view. This issue arises when the set of LSPs is recalculated by a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b135aed2eba093ad31d08d6b92d77eb1
https://doi.org/10.1016/s1389-1286(03)00189-0
https://doi.org/10.1016/s1389-1286(03)00189-0
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783540727910
IPCO
IPCO
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of certain substructures, called double circuits. In this paper we prove
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c29c3e2438098ab731c597d7f92356db
https://doi.org/10.1007/978-3-540-72792-7_14
https://doi.org/10.1007/978-3-540-72792-7_14
Publikováno v:
2006 International Conference on Transparent Optical Networks.
This paper presents a QoS aware fair routing and bandwidth management method for transport networks. We consider a variant of the maximum concurrent multicommodity flow problem where only paths of bounded length are allowed to carry flow. We show two
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a87a1a20f1b34de29142c6255946bffe
https://doi.org/10.1109/icton.2006.248443
https://doi.org/10.1109/icton.2006.248443
Autor:
Márton Makai, Tamás Király
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783540221135
IPCO
IPCO
As a common generalization of matchings and matroid intersection, W.H. Cunningham and J.F. Geelen introduced the notion of path-matching, which they generalized even further by introducing even factors of weakly symmetric digraphs. Later, a purely co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8a6208b01b04c2bcccd57cf6fa7b9d4
https://doi.org/10.1007/978-3-540-25960-2_31
https://doi.org/10.1007/978-3-540-25960-2_31
Autor:
Márton Makai
Publikováno v:
Discrete Mathematics. (8):1394-1404
Let $H=(V,E)$ be a hypergraph and let $k≥ 1$ and$ l≥ 0$ be fixed integers. Let $\mathcal{M}$ be the matroid with ground-set $E s.t. a$ set $F⊆E$ is independent if and only if each $X⊆V$ with $k|X|-l≥ 0$ spans at most $k|X|-l$ hyperedges of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c2fec9d920d768ed6dba640b3c74b66