All graphs are finite simple undirected graph with no isolated vertices in this paper. It is completed the classification of graphs on which a semidihedral group acts edge-transitively.
The characteristic of MVP is the conversion from netlist to weighted undirected graph and its objective is to improve the efficiency of VLSI partitioner by avoiding partitioning netlist directly.