Can I read Hypergraph Partitioning in Computing on EtoBox?

Hypergraph Partitioning in Computing by James Smith is a document available to read on EtoBox.

What is Hypergraph Partitioning in Computing about?

The hypergraph corresponding to this graph would have 8 vertices (the nodes) and 8 hyperedges (the columns). Each hyperedge would connect the vertices corresponding to the non-zero in that column. The given partitioning cuts 2 hyperedges - the hyperedges corresponding to columns 3 and 5, since they connect vertices in both partitions.

Author

James Smith

Language

EN