Pages that link to "Item:Q1912069"
From MaRDI portal
The following pages link to A new approach to minimising the frontwidth in finite element calculations (Q1912069):
Displaying 7 items.
- The node capacitated graph partitioning problem: A computational study (Q1290618) (← links)
- A retrofit based methodology for the fast generation and optimization of large-scale mesh partitions: Beyond the minimum interface size criterion (Q1371918) (← links)
- Graph bisection revisited (Q1657405) (← links)
- An exact algorithm for graph partitioning (Q1942271) (← links)
- Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
