ga1046@sdcc6.ucsd.edu (AST) (11/07/90)
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. Thanks in advance, ga1046@sdcc6.ucsd.edu
naren@cs.UAlberta.CA (Narendra Ravi) (11/07/90)
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 * =======================================================================