On Bisecting Random Graphs
| dc.contributor.advisor | Rivest, Ronald L. | en_US |
| dc.contributor.author | Bui, Thang Nguyen | en_US |
| dc.date.accessioned | 2023-03-29T15:07:16Z | |
| dc.date.available | 2023-03-29T15:07:16Z | |
| dc.date.issued | 1983-03 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149565 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-287 | |
| dc.title | On Bisecting Random Graphs | en_US |
| dc.identifier.oclc | 9523546 |
