The following information was submitted:
Transactions: WSEAS TRANSACTIONS ON COMPUTERS
Transactions ID Number: 29-604
Full Name: Adrian Deaconu
Position: Associate Professor
Age: ON
Sex: Male
Address: Brasov, Iuliu Maniu 50
Country: ROMANIA
Tel: +40-268412776
Tel prefix:
Fax:
E-mail address: am_deaconu@yahoo.com
Other E-mails: a.deaconu@unitbv.ro
Title of the Paper: Improved Algorithm for Minimum Flows in Bipartite Networks with Unit Capacities
Authors as they appear in the Paper: Eleonor Ciurea, Adrian Deaconu
Email addresses of all the authors: e.ciurea@unitbv.ro, a.deaconu@unitbv.ro
Number of paper pages: 10
Abstract: The theory and applications of network flows is probabily the most important single tool for applications of digraphs and perhaps even of graphs as a whole. In this paper we study minimum flow an algorithm in bipartite networks with unit capacities combining an algorithm for minimum flow in bipartite networks with an algorithm for minimum flow in unit capacity networks. Finally, we present the applications of the minimum flow problem in bipartite networks with unit capacities.
Keywords: network flows, minimum flow problem, unit capacity networks, bipartite networks, maximum cut
EXTENSION of the file: .pdf
Special (Invited) Session:
Organizer of the Session:
How Did you learn about congress:
IP ADDRESS: 79.116.234.14
