The following pages link to (Q5683627):
Displayed 43 items.
- A physical interpretation of factorization and factor modification in structural analysis (Q790661) (← links)
- Some aspects of perfect elimination orderings in chordal graphs (Q792351) (← links)
- A mathematical model and numerical method for studying platelet adhesion and aggregation during blood clotting (Q802486) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Hardness of edge-modification problems (Q1034612) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- Characterization of partial 3-trees in terms of three structures (Q1086577) (← links)
- The analysis of a nested dissection algorithm (Q1103322) (← links)
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs (Q1111390) (← links)
- Maximal chordal subgraphs (Q1115455) (← links)
- Solution of sparse positive definite systems on a hypercube (Q1124265) (← links)
- An automatic scaling procedure for a D'yakonov-Gunn iteration scheme (Q1136207) (← links)
- A fast algorithm for solving systems of linear equations with two variables per equation (Q1149227) (← links)
- Partitioning, tearing and modification of sparse linear systems (Q1212513) (← links)
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix (Q1243572) (← links)
- Numerical analysis of blood flow in the heart (Q1256381) (← links)
- Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)
- Minimal vertex separators of chordal graphs (Q1281392) (← links)
- Predicting the structure of sparse orthogonal factors (Q1318224) (← links)
- New linear time algorithms for generating perfect elimination orderings of chordal graphs (Q1350607) (← links)
- A parallel multifrontal algorithm and its implementation (Q1387979) (← links)
- A practical algorithm for making filled graphs minimal (Q1589427) (← links)
- Bandwidth and pebbling (Q1838912) (← links)
- On simple characterizations of k-trees (Q1844861) (← links)
- Weighted graph based ordering techniques for preconditioned conjugate gradient methods (Q1893941) (← links)
- A faster algorithm to recognize undirected path graphs (Q2367409) (← links)
- Can transitive orientation make sandwich problems easier? (Q2370442) (← links)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- NP-completeness results for edge modification problems (Q2500532) (← links)
- Graph Coloring Using Eigenvalue Decomposition (Q3216692) (← links)
- A Separator Theorem for Chordal Graphs (Q3344230) (← links)
- Wheel-Free Deletion Is W[2]-Hard (Q3503585) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints (Q3511357) (← 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)
- The General Minimum Fill-In Problem (Q3802913) (← links)
- Computing the Minimum Fill-In is NP-Complete (Q3960122) (← links)
- Heuristic and metaheuristic methods for computing graph treewidth (Q5479837) (← links)
- Complexity classification of some edge modification problems (Q5948964) (← links)