Pages that link to "Item:Q1371661"
From MaRDI portal
The following pages link to Using domain decomposition to find graph bisectors (Q1371661):
Displaying 5 items.
- On sparse matrix orderings in interior point methods (Q402236) (← links)
- Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)
- From Graph Orientation to the Unweighted Maximum Cut (Q2817879) (← links)
- Spectral bounds for the maximum cut problem (Q3632965) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
