DSpace
 

DSpace at IIT Bombay >
IITB Publications >
Article >

Please use this identifier to cite or link to this item: http://dspace.library.iitb.ac.in/jspui/handle/10054/12029

Title: A FAST ALGORITHM FOR THE PRINCIPAL PARTITION OF A GRAPH
Authors: PATKAR, S
NARAYANAN, H
Issue Date: 1991
Publisher: SPRINGER
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.
URI: http://dspace.library.iitb.ac.in/xmlui/handle/10054/12029
http://hdl.handle.net/10054/12029
ISSN: 0302-9743
Appears in Collections:Article

Files in This Item:

There are no files associated with this item.

View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback