/ ! This function initializes a graph_t data structure */ /

/ ! This function computes the initial separator of the coarsest graph */ /

Rook search for a large entry in inverse(B). If successful, returns [p,i,x] where x is the entry at position (p,i) of inverse(B). Notice that p corres

/ ! This function matches the unmatched vertices whose degree is less than maxdegree using a 2-hop matching that involves vertices that are two

* This function performs an edge-based FM refinement **************************************************************************/

/ ! This is the driver for the recursive tri-section of a graph into the left, separator, and right partitions. The graphs correspond to the

/ ! This routine is similar to its non 'CC' counterpart. The difference is that after each tri-section, the connected components of the original