Motif conductance. Edge conductance is adapted for motifs in [1]}. Motif conductance of a subgraph is defined as the ratio of the number of motif instances cut (i.e., motifs in the boundary) to the number of motif instance end points in the subgraph (i.e., nodes participating in the motifs). The lower values are better.

