Алгоритм выделения блочно-древовидной структуры в разреженных задачах дискретной оптимизации

Authors propose an algorithm of computing block-tree structure for sparse matrices. Finkelshtein’s algorithm for constructing quasiblock structures is modified and implemented. Preliminary benchmarking with test problems was done. Quality of computed quasiblock structures is investigated.