• 网络嵌入（Network Embeddings）

• Dilation

Longest path onto which any given edge is mapped.

• Congestion

Maximum number of edges mapped onto one edge.

• Load Factor

Maximum number of nodes mapped onto one node.

• Expansion

Ratio of the number of nodes in the two graphs.