Algorithmic Aspects of Vertex Elimination on Directed Graphs
From MaRDI portal
Publication:4155746
Cited in
(30)- On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs
- A survey of direct methods for sparse linear systems
- Computing the Minimum Fill-In is NP-Complete
- On lower bounds for optimal Jacobian accumulation
- Sparse linear problems and the least squares method
- On the ordering of sparse linear systems
- Minimal fill in O(\(n^{2.69}\)) time
- Digraph measures: Kelly decompositions, games, and orderings
- A Note on the NP-Completeness of Vertex Elimination on Directed Graphs
- Chordal digraphs
- Positive definite completions of partial Hermitian matrices
- Search-space size in contraction hierarchies
- On strictly chordality-\(k\) graphs
- Combinatorial analysis (nonnegative matrices, algorithmic problems)
- Computational complexity of some intelligent computing systems
- Recognizing badly presented \(Z\)-modules
- Recognizing sparse perfect elimination bipartite graphs
- Inherited Matrix Entries: Principal Submatrices of the Inverse
- Predicting the structure of sparse orthogonal factors
- Several results on chordal bipartite graphs
- On the minimum chordal completion polytope
- Deterministic inverse zero-patterns
- Determinantal formulae and nonsymmetric gaussian perfect elimination
- A matrix-free exact Newton method
- Degree switching operations in networks and large scale systems assignment problems
- Reordering strategy for blocking optimization in sparse linear solvers
- Iterative methods for linear systems of equations: a brief historical journey
- The importance of structure in incomplete factorization preconditioners
- Digraphs of bounded elimination width
- A note on perfect partial elimination
This page was built for publication: Algorithmic Aspects of Vertex Elimination on Directed Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4155746)