Please create an account to participate in the Slashdot moderation system

 



Forgot your password?
typodupeerror

Submission Summary: 0 pending, 1 declined, 0 accepted (1 total, 0.00% accepted)

Slashdot videos: Now with more Slashdot!

  • View

  • Discuss

  • Share

We've improved Slashdot's video section; now you can view our video interviews, product close-ups and site visits with all the usual Slashdot options to comment, share, etc. No more walled garden! It's a work in progress -- we hope you'll check it out (Learn more about the recent updates).

×

+ - First Improvement of Fundamental Algorithm in 10 Y->

Submitted by TelavianX
TelavianX (1888030) writes "Massachusetts Institute of Technology (MIT) researchers, in collaboration with colleagues at Yale University and the University of Southern California, have demonstrated the first improvement to the maximum-flow (max flow) algorithm in 10 years. The max flow problem calculates the maximum amount of data that can move from one end of a network to another, considering the capacity limitations of the network's links. The researchers' new approach represents a network's graph as a matrix. Each node in the graph is assigned one row and one column of the matrix, with the intersections representing the amount of data that may be transferred between two nodes. The researchers can evaluate the whole graph at once by repeatedly modifying the numbers in the matrix and resolving the equations. "My guess is that this particular framework is going to be applicable to a wide range of other problems," says Cornell University professor John Hopcroft, co-recipient of the 1986 A.M. Turing Award. "When there's a breakthrough of that nature, usually, then, a subdiscipline forms, and in four or five years, a number of results come out.""
Link to Original Source

CCI Power 6/40: one board, a megabyte of cache, and an attitude...

Working...