In this paper, we propose a novel method, Multi-View Pruning (MVP), to improve the efficiency of graph pooling. While existing graph pooling methods tend to remove nodes mainly based on the degree of the node, MVP solves this problem by considering the importance of the node from multiple viewpoints. Specifically, MVP splits the input graph into graphs with multiple views and learns the score of each node by considering both the reconstruction loss and the task loss. We demonstrate improved performance compared to existing graph pooling methods on various benchmark datasets, and we confirm through analysis that multi-view encoding and consideration of the reconstruction loss are the key factors for the performance improvement.