The STUDIA UNIVERSITATIS BABE┼×-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. 1 / 2008  
         
  Article:   MINIMUM FLOW ALGORITHMS. DYNAMIC TREE IMPLEMENTATIONS.

Authors:  ELEONOR CIUREA, OANA GEORGESCU, MIHAI IOLU.
 
       
         
  Abstract:  We present augmenting path algorithms for minimum flows with dynamic tree implementations. The time bounds for augmenting path for minimum flows automatically improve when the algorithms are implemented with dynamic tree.  
         
     
         
         
      Back to previous page