Path: utzoo!attcan!uunet!samsung!zaphod.mps.ohio-state.edu!usc!ucsd!sdcc6!ga1046
From: ga1046@sdcc6.ucsd.edu (AST)
Newsgroups: comp.theory
Subject: Graph partition code needed
Message-ID: <13950@sdcc6.ucsd.edu>
Date: 6 Nov 90 19:21:36 GMT
Distribution: na
Organization: University of California, San Diego
Lines: 11

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