Graph extensions and some optimization problems in sparse matrix computations

zbMATH Open0997.65076MaRDI QIDQ2767414

Yixun Lin

Publication date: 29 January 2002

Published in: Advances in Mathematics (Beijing) (Search for Journal in Brave)

zbMATH Keywords

optimizationcomputational complexitygraph extensionsparse matrix storagesparse matrix computationselimination, graph labelingpolynom-time algorithms

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (4)

Title not available (Why is that?) ⋮ Algebraic graph theory for sparse flexibility matrices ⋮ Efficient algorithms for the \(d\)-dimensional rigidity matroid of sparse graphs ⋮ Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes

This page was built for publication: Graph extensions and some optimization problems in sparse matrix computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2767414)