scientific article; zbMATH DE number 554763
From MaRDI portal
Publication:4288579
zbMath0803.68082MaRDI QIDQ4288579
Ajit Agrawal, R. Ravi, Philip N. Klein
Publication date: 19 April 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Factorization of matrices (15A23) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Minimal elimination of planar graphs ⋮ Separators and structure prediction in sparse orthogonal factorization ⋮ Unnamed Item ⋮ Searching for better fill-in ⋮ Minimizing elimination tree height can increase fill more than linearly ⋮ Minimum fill-in of sparse graphs: kernelization and approximation ⋮ On the ordering of sparse linear systems ⋮ Algorithms for automatic ranking of participants and tasks in an anonymized contest ⋮ Complexity classification of some edge modification problems ⋮ Minimum fill-in: inapproximability and almost tight lower bounds ⋮ Unnamed Item ⋮ Approximation algorithms in combinatorial scientific computing
This page was built for publication:
