An Approximate Minimum Degree Ordering Algorithm Patrick R. Amestoy∗ Timothy A. Davis†

Source URL: faculty.cse.tamu.edu

Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments? Christian Komusiewicz, Manuel Sorge, and Kolja Stahl Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany

Source URL: fpt.akt.tu-berlin.de

• Graph theory
• NP-complete problems
• Graph operations
• Clique
• Degeneracy
• Tree
• Degree
• Vertex
• Neighbourhood
• Clique problem
• BronKerbosch algorithm

Thesis for the degree ‫עבודת גמר (תזה) לתואר‬ Master of Science

Source URL: www.wisdom.weizmann.ac.il

• Combinatorial optimization
• NP-complete problems
• Cut
• Streaming algorithm
• Maximum cut
• Hypergraph
• Time complexity
• Minimum cut
• Matching
• Theoretical computer science
• Graph theory
• Mathematics

NEWTON-GMRES PRECONDITIONING FOR DISCONTINUOUS GALERKIN DISCRETIZATIONS OF THE NAVIER-STOKES EQUATIONS P.-O. PERSSON∗ AND J. PERAIRE† Abstract. We study preconditioners for the iterative solution of the linear system

Source URL: raphael.mit.edu

• Numerical linear algebra
• Preconditioner
• Sparse matrix
• Galerkin method
• Multigrid method
• LU decomposition
• Minimum degree algorithm
• Matrix decomposition
• Conjugate gradient method
• Numerical analysis
• Mathematics
• Algebra

Native mesh ordering with Scotch 4.0 Fran¸cois Pellegrini INRIA Futurs – Project ScAlApplix [removed] Abstract. Sparse matrix reordering is a key issue for the the efficient

Source URL: www.labri.fr

• Numerical linear algebra
• Sparse matrices
• Matrix theory
• Nested dissection
• Minimum degree algorithm
• Graph
• Bipartite graph
• Adjacency list
• Planar separator theorem
• Graph theory
• Mathematics
• Algebra