Change search
ReferencesLink to record
Permanent link

Direct link
An Efficient Algorithm for Graph Bisection of Triangularizations
Department of Computer Science, Washington University, Campus Box 1045, One Brookings Drive, St. Louis, Missouri 63130-4899, USA.
2007 (English)In: Applied Mathematical Sciences, ISSN 1312-885X, Vol. 1, no 25, 1203-1215 p.Article in journal (Refereed) Published
Abstract [en]

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.
Keyword [en]
Graph bisection, hierarchical matrices, triangularizations
National Category
Discrete Mathematics
URN: urn:nbn:se:umu:diva-82905OAI: diva2:663883
Available from: 2013-11-13 Created: 2013-11-13 Last updated: 2013-11-14Bibliographically approved

Open Access in DiVA

No full text

Other links

Search in DiVA

By author/editor
Jäger, Gerold
In the same journal
Applied Mathematical Sciences
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 30 hits
ReferencesLink to record
Permanent link

Direct link