The following pages link to Generalized Nested Dissection (Q3875202):
Displaying 50 items.
- Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity (Q92247) (← links)
- Search-space size in contraction hierarchies (Q306264) (← links)
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs (Q396709) (← links)
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
- Transformations of matrix structures work again (Q471925) (← links)
- A hysteretic multiscale formulation for nonlinear dynamic analysis of composite materials (Q487763) (← links)
- Small grid embeddings of 3-polytopes (Q629826) (← links)
- Sparse direct factorizations through unassembled hyper-matrices (Q649249) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- Estimating the extremal eigenvalues of a symmetric matrix (Q753418) (← links)
- Calculs de complexité relatifs à une méthode de dissection emboîtée (Q792734) (← links)
- Drawing plane graphs nicely (Q797289) (← links)
- Vecchia-Laplace approximations of generalized Gaussian processes for big non-Gaussian spatial data (Q830598) (← links)
- Fast dynamic transitive closure with lookahead (Q848959) (← links)
- On the negative cost girth problem in planar networks (Q891820) (← links)
- Convex drawings of graphs with non-convex boundary constraints (Q947122) (← links)
- Separator theorems and Turán-type results for planar intersection graphs (Q947779) (← links)
- Randomized preprocessing of homogeneous linear systems of equations (Q968998) (← links)
- Single source shortest paths in \(H\)-minor free graphs (Q986535) (← links)
- Finding small simple cycle separators for 2-connected planar graphs (Q1085169) (← links)
- Efficient solutions of hierarchical systems of linear equations (Q1089723) (← links)
- Parallel nested dissection for path algebra computations (Q1095781) (← links)
- The analysis of a nested dissection algorithm (Q1103322) (← links)
- A parallel graph partitioning algorithm for a message-passing multiprocessor (Q1111029) (← links)
- Algorithms for multicommodity flows in planar graphs (Q1119160) (← links)
- Local optimization on graphs (Q1122503) (← links)
- Solution of sparse positive definite systems on a hypercube (Q1124265) (← links)
- Efficient approximate solution of sparse linear systems (Q1125019) (← links)
- Not all planar digraphs have small cycle separators (Q1201868) (← links)
- Edge separators for graphs of bounded genus with applications (Q1210307) (← links)
- Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
- Flow in planar graphs with vertex capacities (Q1317474) (← links)
- Provably good mesh generation (Q1329150) (← links)
- Supersonic viscous perfect gas flow past a circular cylinder (Q1339624) (← links)
- Separators and structure prediction in sparse orthogonal factorization (Q1361831) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Refining an approximate inverse (Q1591188) (← links)
- Numerical linear algebra algorithms and software (Q1591199) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- Underestimated cost of targeted attacks on complex networks (Q1646528) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q1775778) (← links)
- Dividing and conquering the square (Q1801677) (← links)
- Steady flow with separation past a thin airfoil at high Reynolds numbers (Q1815111) (← links)
- Efficient parallel linear programming (Q1821686) (← links)
- Fast and efficient solution of path algebra problems (Q1824392) (← links)
- Preconditioning techniques for large linear systems: A survey (Q1868569) (← links)
- A new approach to solving three combinatorial enumeration problems on planar graphs (Q1894355) (← links)
- Parallel computation of a Krylov matrix for a sparse and structured input (Q1900259) (← links)
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives (Q1954336) (← links)
- Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles (Q2017836) (← links)
