Pages that link to "Item:Q4726293"
From MaRDI portal
The following pages link to Optimal Numberings of an $N \times N$ Array (Q4726293):
Displayed 20 items.
- On a binary distance model for the minimum linear arrangement problem (Q458974) (← links)
- An optimal time algorithm for minimum linear arrangement of chord graphs (Q497140) (← links)
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem (Q732777) (← links)
- Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
- Locality and bounding-box quality of two-dimensional space-filling curves (Q1037780) (← links)
- On a problem of Kleitman and West (Q1182891) (← links)
- Examining the volume efficiency of the cortical architecture in a multi- processor network model (Q1310585) (← links)
- Formation of field discontinuities and islands in visual cortical maps (Q1323560) (← links)
- Towards optimal locality in mesh-indexings (Q1348392) (← links)
- On minimum cuts and the linear arrangement problem (Q1570828) (← links)
- Improved exact approaches for row layout problems with departments of equal length (Q1651703) (← links)
- Layout of random circulant graphs (Q1794318) (← links)
- Vertex ordering and partitioning problems for random spatial graphs. (Q1884828) (← links)
- On bandwidth and edgesum for the composition of two graphs (Q1897434) (← links)
- Node set optimization problem for complete Josephus cubes (Q2279757) (← links)
- Minimum linear arrangement of chord graphs (Q2518728) (← links)
- (Q2861498) (← links)
- Towards optimal locality in mesh-indexings (Q5055949) (← links)
- Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path (Q5087084) (← links)
- Experiments on the minimum linear arrangement problem (Q5463444) (← links)
