Pages that link to "Item:Q4039501"

The following pages link to Algorithms for reducing the bandwidth and profile of a sparse matrix (Q4039501):

Displaying 21 items.

• A constructive bandwidth reduction algorithm -- a variant of GPS algorithm (Q504151) (← links)
• An evaluation of low-cost heuristics for matrix bandwidth and profile reductions (Q725777) (← links)
• A review on the application of fuzzy transform in data and image compression (Q780186) (← links)
• Heuristics for matrix bandwidth reduction (Q858330) (← links)
• On the profile of the corona of two graphs (Q1029099) (← links)
• Algorithms for the reduction of matrix bandwidth and profile (Q1066617) (← links)
• GRASP and path relinking for the matrix bandwidth minimization. (Q1417505) (← links)
• Processor-efficient sparse matrix-vector multiplication (Q1767967) (← links)
• Profile minimization on compositions of graphs (Q2471064) (← links)
• Profile minimization on products of graphs (Q2495515) (← links)
• Simple heuristic algorithm for profile reduction of arbitrary sparse matrix (Q2572728) (← links)
• Bandwidth reduction in sparse matrices (Q2893631) (← links)
• The Bandwidths of a Matrix. A Survey of Algorithms (Q2972909) (← links)
• A hybrid algorithm for reducing matrix bandwidth (Q3340028) (← links)
• An algorithm for profile and wavefront reduction of sparse matrices (Q3736810) (← links)
• (Q3776495) (← links)
• A comparison of three algorithms for reducing the profile of a sparse matrix (Q4206305) (← links)
• (Q4375950) (← links)
• Algorithm 807 (Q4406295) (← links)
• Reducing the bandwidth of a sparse matrix with tabu search. (Q5952446) (← links)
• Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices (Q5959245) (← links)