Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Eleonor Ciurea"'
Autor:
Eleonor Ciurea, Laura Ciupal
Publikováno v:
Computer Science Journal of Moldova, Vol 9, Iss 3(27), Pp 275-290 (2001)
We present a generic preflow algorithm and several implementations of it, that solve the minimum flow problem in O(n2m) time. AMS Mathematics Subject Classification: 90B10, 90C35, 05C35, 68R10
Externí odkaz:
https://doaj.org/article/7e1c52f3845d41ddbe407581a0807652
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
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
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 52:43-53
The paper presents a dynamic solution method for the parametric minimum flow in time-dependent, dynamic network. This approach solves the problem for a special parametric dynamic network with linear lower bound functions of a single parameter. Instea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5448b640a1cabb503dbbbd89569ba556
https://doi.org/10.1051/ita/2018002
https://doi.org/10.1051/ita/2018002
Publikováno v:
Fundamenta Informaticae. 156:125-139
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c94898d5a72ebbc87a754b933e45b1a0
https://doi.org/10.3233/fi-2017-1600
https://doi.org/10.3233/fi-2017-1600
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
Autor:
Eleonor Ciurea, Mircea Parpalea
Publikováno v:
British Journal of Applied Science & Technology. 13:1-8
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d6873180097c1882bba9cc3568354d3
https://doi.org/10.9734/bjast/2016/22636
https://doi.org/10.9734/bjast/2016/22636
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:
Mircea Parpalea, Eleonor Ciurea
Publikováno v:
Applied Mathematics. :3-10
The article presents an approach to the maximum flow problem in parametric networks with linear capacity functions of a single parameter, based on the concept of shortest conditional augmenting directed path. In order to avoid working with piecewise
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0dfd749da50a62a3d56f359e51c2410
https://doi.org/10.4236/am.2013.410a1002
https://doi.org/10.4236/am.2013.410a1002
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