최소차수순서화의 자료구조개선과 효율화에 관한 연구

Data structures and the performance improvement of the minimum degree ordering method

The ordering method is used to reduce the fill-ins in interior point methods. In ordering, the data structure plays an important role. In this paper, first, we compare the efficiency and the memory storage requirement of the quotient graph structure and the clique storage. Next, we propose a method of reducing the number of cliques and a data structure for clique storage. Finally, we apply a method of merging rows and absorbing cliques and show the experimental results.