Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Camelia Schiopu"'
Publikováno v:
International Journal of Environmental Research and Public Health; Volume 19; Issue 9; Pages: 5756
The European Union (EU) labor market needs a better-skilled workforce that can work in any of the Member States. In order to develop the skills and competencies of future competitors in this market, several student mobility programs have been set up
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5874d1e8d665ef809a5f6dac974eb324
https://pubmed.ncbi.nlm.nih.gov/35565160
https://pubmed.ncbi.nlm.nih.gov/35565160
Publikováno v:
Journal of Circuits, Systems and Computers. 31
Planar networks are an important special class of networks that arise in several application contexts. Because of the special structure of planar networks, network flow algorithms often run faster on these networks than they do on more general networ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::888e9dfbb114f6ea24f87d4ad7cf3d59
https://doi.org/10.1142/s0218126622300045
https://doi.org/10.1142/s0218126622300045
Publikováno v:
Bulletin of the Transilvania University of Brasov Series III Mathematics and Computer Science. 61:177-198
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dcfa36ddff96ed5e9dedd06bfc49a6cf
https://doi.org/10.31926/but.mif.2019.12.61.1.14
https://doi.org/10.31926/but.mif.2019.12.61.1.14
Autor:
Camelia Schiopu, Eleonor Ciurea
Publikováno v:
Fundamenta Informaticae. 163:189-204
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::743f938ddc5c29001c6c6fa862560d48
https://doi.org/10.3233/fi-2018-1737
https://doi.org/10.3233/fi-2018-1737
Autor:
Eleonor Ciurea, Camelia Schiopu
Publikováno v:
CoDIT
This article states and solves the minimum flows in directed ( $1, n$ ) planar dynamic networks. We present the case when the planar dynamic network is stationary. A numerical example is presented finally.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b2fcf2ceb42fd90ebfb46f52f5ef0490
https://doi.org/10.1109/codit.2019.8820635
https://doi.org/10.1109/codit.2019.8820635
Publikováno v:
CoDIT
We present an algorithm for finding maximum cut and an algorithm for finding minimum flow in directed s-t planar networks with arcs and nodes capacities. As a final part, we present an example for these two algorithms.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8bb9f9ed81a810687c3d32737c75a31a
https://doi.org/10.1109/codit.2018.8394790
https://doi.org/10.1109/codit.2018.8394790
Autor:
Camelia Schiopu, Eleonor Ciurea
Publikováno v:
2016 6th International Conference on Computers Communications and Control (ICCCC).
In this paper we study maximum flow algorithms for bipartite dynamic networks with lower bounds. We resolve this problem by rephrasing into a problem in bipartite static network. In a bipartite static network the several maximum flow algorithms can b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f555d2eba4111fdc232a75d2fea1520a
https://doi.org/10.1109/icccc.2016.7496731
https://doi.org/10.1109/icccc.2016.7496731
Autor:
Eleonor Ciurea, Camelia Schiopu
Publikováno v:
International Journal of Computers Communications & Control. 12:103
In this paper we study two flow problems: the feasible flow problem in dynamic networks and the maximum flow problem in bipartite dynamic networks with lower bounds. We mention that the maximum flow problem in bipartite dynamic networks with lower bo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec05c8a055596e2c7206b003b0d37997
https://doi.org/10.15837/ijccc.2017.1.2786
https://doi.org/10.15837/ijccc.2017.1.2786
Autor:
Camelia Schiopu, Eleonor Ciurea
Publikováno v:
International Journal of Computers Communications & Control. 11:282
An nontrivial extension of the maximal static flow problem is the maximal dynamic flow model, where the transit time to traverse an arc is taken into consideration. If the network parameters as capacities, arc traversal times, and so on, are constant
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0b7cd14cd6ebfa72ff07ebe1a801159
https://doi.org/10.15837/ijccc.2016.2.2444
https://doi.org/10.15837/ijccc.2016.2.2444
Autor:
ŞCHIOPU, Camelia1 camelia.s@unitbv.ro
Publikováno v:
Bulletin of the Transilvania University of Brasov, Series V: Economic Sciences. 2015, Vol. 8 Issue 2, p499-506. 8p.