Please use this identifier to cite or link to this item:
|Title:||A FAST ALGORITHM FOR THE PRINCIPAL PARTITION OF A GRAPH|
|Citation:||LECTURE NOTES IN COMPUTER SCIENCE, 560(), 288-306|
|Abstract:||We present an O(Absolute value of E 2 Absolute value of V log Absolute value of V)) algorithm for the construction of the principal partition of a graph. The best known earlier algorithm for this problem is O(Absolute value of E 3 log Absolute value of V)). Our approach differs from the earlier approaches in that it is node-partition based rather than edge-set based. We use flow maximization as our basic subroutine.|
|Appears in Collections:||Article|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.