Pages that link to "Item:Q1103322"

The following pages link to The analysis of a nested dissection algorithm (Q1103322):

Displaying 20 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)
• On the stabbing number of a random Delaunay triangulation (Q857055) (← links)
• A parallel graph partitioning algorithm for a message-passing multiprocessor (Q1111029) (← links)
• Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver) (Q1114300) (← links)
• Solution of sparse positive definite systems on a hypercube (Q1124265) (← links)
• Efficient approximate solution of sparse linear systems (Q1125019) (← links)
• Parallel computation of a Krylov matrix for a sparse and structured input (Q1900259) (← links)
• Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
• LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
• Almost exact matchings (Q2429356) (← links)
• A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem (Q3503843) (← links)
• Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées (Q3789083) (← links)
• Graph Bisection with Pareto Optimization (Q4577953) (← links)
• Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
• Customizable Contraction Hierarchies (Q5266613) (← links)
• A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling (Q5270706) (← links)
• A survey of direct methods for sparse linear systems (Q5740079) (← links)
• Tree decompositions and social graphs (Q5856440) (← links)
• Maximum matchings in geometric intersection graphs (Q6050213) (← links)