Dahlhaus, Elias
(2002).
Minimal Elimination Ordering for Graphs of Bounded Degree.
Discrete Applied Mathematics, 116 (1-2).
pp. 127-143.
Elsevier Science.
Preview |
PDF
zaik1999-354.pdf - Draft Version Download (205kB) | Preview |
Abstract
We show that for graphs of bounded degree, a subset minimal elimination ordering can be determined in almost linear time.
| Item Type: | Article |
| Creators: | Creators Email ORCID ORCID Put Code Dahlhaus, Elias UNSPECIFIED UNSPECIFIED UNSPECIFIED |
| URN: | urn:nbn:de:hbz:38-548383 |
| Journal or Publication Title: | Discrete Applied Mathematics |
| Volume: | 116 |
| Number: | 1-2 |
| Page Range: | pp. 127-143 |
| Date: | 2002 |
| Publisher: | Elsevier Science |
| 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/54838 |
Downloads
Downloads per month over past year
Export
Actions (login required)
 |
View Item |