Dahlhaus, Elias
(1999).
An Improved Linear Time Algorithm for Minimal Elimination Ordering in Planar Graphs that is Parallelizable.
Working Paper.
|
PDF
zaik1999-353.pdf Download (200kB) | Preview |
Abstract
We present an alternative linear time algorithm that computes an ordering that produces a fill-in that is minimal with respect to the subset relation. It is simpler than an earlier algorithm of the author and is easily parallelizable. The algorithm does not rely on the computation of a breadth-first search tree.
| Item Type: | Preprints, Working Papers or Reports (Working Paper) | ||||||||
| Creators: |
|
||||||||
| URN: | urn:nbn:de:hbz:38-548379 | ||||||||
| Date: | 1999 | ||||||||
| Language: | English | ||||||||
| Faculty: | Faculty of Mathematics and Natural Sciences | ||||||||
| Divisions: | Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science | ||||||||
| Subjects: | Data processing Computer science | ||||||||
| Refereed: | No | ||||||||
| URI: | http://kups.ub.uni-koeln.de/id/eprint/54837 |
Downloads
Downloads per month over past year
Export
Actions (login required)
 |
View Item |