Graph extensions and some optimization problems in sparse matrix computations (Q2767414)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph extensions and some optimization problems in sparse matrix computations |
scientific article; zbMATH DE number 1697424
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph extensions and some optimization problems in sparse matrix computations |
scientific article; zbMATH DE number 1697424 |
Statements
29 January 2002
0 references
sparse matrix storage
0 references
elimination, graph labeling
0 references
graph extension
0 references
optimization
0 references
sparse matrix computations
0 references
computational complexity
0 references
polynom-time algorithms
0 references
Graph extensions and some optimization problems in sparse matrix computations (English)
0 references
The author presents theoretic approaches for a class of optimization problems from sparse matrix computations. These approaches facilitate the study in several aspects, as follows. The first aspect is the computational complexity. Some results are obtained on the complexity by using the relations between problems in different areas. By using the neighbourhood representations efficient heuristic algorithms are designed. Further special cases are studied for which there exist polynom-time algorithms. Finally, relations between different graph-theoretic parameters are given.
0 references
