Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. LCS Publications
  4. LCS Technical Reports (1974 - 2003)
  5. On Bisecting Random Graphs

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
https://hdl.handle.net/1721.1/149565
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.