We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

On Bisecting Random Graphs

Thumbnail Image
Download
Name

MIT-LCS-TR-287.pdf

Size

1.28 MB

Format

Adobe PDF

Checksum (MD5)

fabb77878575ea1fd1964c5668314bab

Author(s)
Bui, Thang Nguyen
Advisor(s)
Rivest, Ronald L.
Date Issued
March 1983
Series/Report no.
MIT-LCS-TR-287
Abstract
A bisection of a graph with an even number of vertices is a partition of the vertex set into two disjoint sets of equal size. Given a bisection, the number of edges having one end in each of the two subsets of the bisection is called the size of the bisection. The bisection size of a graph is the minimum size of all possible bisections of the graph.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.