Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!mit-eddie!uw-beaver!ubc-cs!alberta!naren From: naren@cs.UAlberta.CA (Narendra Ravi) Newsgroups: comp.theory Subject: Re: Graph partition code needed Message-ID: Date: 6 Nov 90 23:53:41 GMT References: <13950@sdcc6.ucsd.edu> Sender: news@cs.UAlberta.CA (News Administrator) Distribution: na Organization: University of Alberta, Edmonton, Alberta, Canada Lines: 20 ga1046@sdcc6.ucsd.edu (AST) writes: >Does any one have a C program code available in public for >the following graph partition problem? >Given an undirected graph, one wants to partition >the graph into two equal size subgraphs such that >the total number of crossing edges between >the two subgraphs is minimal or near minimal. Please post this information. Naren. -- ======================================================================= * Narendra Ravi * 615, General Services Building, * * Email : naren@cs.ualberta.ca * Department of Computing Science * * Tel : (403) 492-3520 (Off) * University of Alberta * * (403) 439-6301 (Res) * Edmonton, Alberta, CANADA T6G 2H1 * =======================================================================