Talk:Bisection bandwidth

Untitled

I am going to remove the following anonymous edit:

"(That should read "two subgraphs of equal size". Clearly the minimum number of channels whose removal would partition the network into two subgraphs of arbitrary size is simply the number of channels into any single vertex.)"

This is not true. Consider two graphs, G1 and G2, of different size (say G1 has m vertices, and G2 has n vertices, where m != n). In G1 each vertex is connected to every other vertex, and similarly in G2 each vertex is connected to every other vertex. Now connect one vertex in G1 to one vertex in G2 to make a new graph G'. Clearly each vertex in G' has at least degree min{m-1,n-1}, but we can divide G' into two subgraphs of different size by cutting just one edge - namely the one we just drew to connect G1 and G2.

Imran 19:57, 23 February 2007 (UTC)

Clearly, though, the current definition has its flaws, and it is not how the phrase is used.

Quanticles 16:23, 8 October 2007 (UTC)

Also note the definition of bisection:

In geometry, bisection is the division of something into two equal parts, usually by a line, which is then called a bisector. The most often considered types of bisectors are segment bisectors and angle bisectors.

I confirmed with the Computer Architecture book to verify, and posted my own definition.

Quanticles 16:48, 8 October 2007 (UTC)

Wiki Education Foundation-supported course assignment

This article is or was the subject of a Wiki Education Foundation-supported course assignment. Further details are available on the course page. Student editor(s): Skota4.

Above undated message substituted from Template:Dashboard.wikiedu.org assignment by PrimeBOT (talk) 09:38, 18 January 2022 (UTC)