The following information was submitted:
Transactions: WSEAS TRANSACTIONS ON COMPUTERS
Transactions ID Number: 27-369
Full Name: Oana Georgescu
Position: Ph.D. Candidate
Age: ON
Sex: Female
Address: Str. Iuliu Maniu nr.50, 500091, Brasov
Country: ROMANIA
Tel: 004-0723-322965
Tel prefix: 0040
Fax: 004-0268-414016
E-mail address: o.georgescu@unitbv.ro
Other E-mails: gescoana@gmail.com
Title of the Paper: An algorithm for minimum flows
Authors as they appear in the Paper: Oana Georgescu, Eleonor Ciurea
Email addresses of all the authors: o.georgescu@unitbv.ro, e.ciurea@unitbv.ro
Number of paper pages: 10
Abstract: In this paper we consider an advanced topic for minimum flow problem: the use of the dynamic trees data structure to efficiently implement decreasing path algorithm. In the final part of the paper we present an example for this algorithm, some practical applications for the minimum flow problem, conclusions and open problems.
Keywords: network flow, network algorithms, minimum flow problem, dynamic tree
EXTENSION of the file: .pdf
Special (Invited) Session: Decreasing path algorithm for minimum flows. Dynamic tree implementations
Organizer of the Session: 591-310
How Did you learn about congress:
IP ADDRESS: 213.233.101.173
