Pages that link to "Item:Q1327828"

The following pages link to Profile minimization problem for matrices and graphs (Q1327828):

Displaying 17 items.

• An evaluation of low-cost heuristics for matrix bandwidth and profile reductions (Q725777) (← links)
• Fixed-parameter complexity of minimum profile problems (Q958202) (← links)
• Parameterizing above or below guaranteed values (Q1004602) (← links)
• The profile of the Cartesian product of graphs (Q1005223) (← links)
• On the profile of the corona of two graphs (Q1029099) (← links)
• A variable neighborhood search and simulated annealing hybrid for the profile minimization problem (Q1652400) (← links)
• Optimal labelling of unit interval graphs (Q1906576) (← links)
• An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method (Q1993591) (← links)
• Addressing the envelope reduction of sparse matrices using a genetic programming system (Q2352428) (← links)
• Profile minimization on compositions of graphs (Q2471064) (← links)
• Profile minimization on products of graphs (Q2495515) (← links)
• An integer programming model for the Minimum Interval Graph Completion Problem (Q2883618) (← links)
• Algorithms and Bounds for L-Drawings of Directed Graphs (Q3177336) (← links)
• A Hypergraph Partitioning Model for Profile Minimization (Q4646452) (← links)
• Partitioning and Reordering for Spike-Based Distributed-Memory Parallel Gauss--Seidel (Q5065494) (← links)
• Deep two-way matrix reordering for relational data analysis (Q6055223) (← links)
• Hardness and approximation of submodular minimum linear ordering problems (Q6634527) (← links)