Mesh Partitioning Techniques and New Observations for 3-regular Graphs
Fabio Guerinoni · OpenGrey (Institut de l'Information Scientifique et Technique) · 1995
We describe in detail some algorithms currently in use for unstructured mesh partitioning, with some emphasis on spectral methods, that is, those methods which involve eigenvector computations. When applied to 3-regular graphs, previous methods can be theoretically improved, should a stated conjecture proves true.