The Null Space Problem II. Algorithms (Q3783422): Difference between revisions

@@ Property / OpenAlex ID @@
+W1990025588
@@ Property / OpenAlex ID: W1990025588 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm to compute a sparse basis of the null space
+Normal rank
@@ Property / cites work @@
+Q3719721
@@ Property / cites work: Q3719721 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Predicting fill for sparse orthogonal factorization
+Normal rank
@@ Property / cites work @@
+Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
+Normal rank
@@ Property / cites work @@
+Estimation of sparse hessian matrices and graph coloring problems
+Normal rank
@@ Property / cites work @@
+The Null Space Problem I. Complexity
@@ Property / cites work: The Null Space Problem I. Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Generating Fundamental Cycles in a Graph
+Normal rank
@@ Property / cites work @@
+Two Remarks on the Mendelsohn-Dulmage Theorem
@@ Property / cites work: Two Remarks on the Mendelsohn-Dulmage Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3664299
@@ Property / cites work: Q3664299 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a Sparse Basis for the Null Space
@@ Property / cites work: Computing a Sparse Basis for the Null Space / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739659
@@ Property / cites work: Q4739659 / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
+Normal rank
@@ Property / cites work @@
+On computational procedures for the force method
@@ Property / cites work: On computational procedures for the force method / rank @@
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3671749
@@ Property / cites work: Q3671749 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
+Normal rank
@@ Property / cites work @@
+Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
+Normal rank