An Efficient Algorithm for Graph Bisection of Triangularizations
2007 (English)In: Applied Mathematical Sciences, ISSN 1312-885X, Vol. 1, no 25, 1203-1215 p.Article in journal (Refereed) Published
Graph bisection is an elementary problem in graph theory. We consider the best known experimental algorithms and introduce a new algorithm called Longest-Path-Algorithm. Applying this algorithm to the cluster tree generation of hierarchical matrices, arising for example in discretizations of partial equations, we show that this algorithm outperforms previous algorithms.
Place, publisher, year, edition, pages
Hikari Ltd. , 2007. Vol. 1, no 25, 1203-1215 p.
Graph bisection, hierarchical matrices, triangularizations
IdentifiersURN: urn:nbn:se:umu:diva-82905OAI: oai:DiVA.org:umu-82905DiVA: diva2:663883