• Cite/Export
  Cite/Export

  Copy a citation

  APA (6th ed.)

  

  Chicago (Author-Date, 15th ed.)

  

  Harvard (18th ed.)

  

  MLA (7th ed.)

  

  Turabian (6th ed.)

  

  Export a citation

  Export to RefWorks   Export to EndNote / Reference Manager   Export to EasyBib   Cancel

  Note: Citations are based on reference standards. However, formatting rules can vary widely between applications and fields of interest or study. The specific requirements or preferences of your reviewing publisher, classroom teacher, institution or organization should be applied.
• Print
• E-mail
  E-mail

  All fields are required.

  The E-mail Address(es) field is required. Please enter recipient e-mail address(es).

  The E-mail Address(es) you entered is(are) not in a valid format. Please re-enter recipient e-mail address(es).

  You may send this item to up to five recipients.

  Enter recipient e-mail address(es): Separate up to five addresses with commas (,)

  The name field is required. Please enter your name.

  Enter your name: The subject field is required. Please enter the subject. Subject:

  The E-mail message field is required. Please enter the message.

  E-mail Message: I thought you might be interested in this item at http://www.worldcat.org/oclc/227718874 Title: A Fast Parametric Maximum Flow Algorithm. Revision. Author: Giorgio Gallo; Michael D Grigoriadis; Robert E Tarjan; PRINCETON UNIV NJ DEPT OF COMPUTER SCIENCE Publisher: Ft. Belvoir Defense Technical Information Center JUL 1987. OCLC:227718874

  
  

  The ReCaptcha terms you entered were incorrect. Please try to match the 2 words shown in the window, or try the audio version.

  Cancel
• Share
• Permalink
  Permalink

  Copy this URL to link to this page:

• Write a review
• Rate this item:
• • 1
  • 2
  • 3
  • 4
  • 5

More like this

Subjects

• Operations Research.
• Algorithms.
• Network flows.
• View all subjects

Similar Items

A Fast Parametric Maximum Flow Algorithm. Revision.

Author:	Giorgio Gallo; Michael D Grigoriadis; Robert E Tarjan; PRINCETON UNIV NJ DEPT OF COMPUTER SCIENCE.
Publisher:	Ft. Belvoir Defense Technical Information Center JUL 1987.
Edition/Format:	Book : EnglishView all editions and formats
Summary:	The classical maximum flow problem sometimes occurs in settings in which the capacities are not fixed but are functions of a single parameters, and the goal is to find the value of the parameter such that the corresponding maximum flow or minimum cut satisfies some side condition. Finding the desired parameter value requires solving a sequence of related maximum flow problems. We shoe that the recent maximum flow algorithm of Goldberg and Tarjan can be extended to solve an important class of such parametric maximum flow problems, at the cost of only a constant factor in its worst case time bound. Faster algorithms for a variety of combinational optimization problems follow from our result. Keywords: Algorithms; Data structures; Graphs; Maximum glow; Network flows; Networks.  Read more...
Rating:	(not yet rated) 0 with reviews - Be the first.