Pages that link to "Item:Q5483510"

The following pages link to Graph minimum linear arrangement by multilevel weighted edge contractions (Q5483510):

Displaying 17 items.

• Summarizing transactional databases with overlapped hyperrectangles (Q408648) (← links)
• 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)
• Multiscale approach for the network compression-friendly ordering (Q553960) (← links)
• A multilevel bilinear programming algorithm for the vertex separator problem (Q683341) (← links)
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem (Q732777) (← links)
• Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
• New relationships for multi-neighborhood search for the minimum linear arrangement problem (Q1679609) (← links)
• Multilevel graph partitioning for three-dimensional discrete fracture network flow simulations (Q2066832) (← links)
• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem (Q2482382) (← links)
• Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
• Maximum incomplete recursive circulants in graph embeddings (Q2788730) (← links)
• Advanced Coarsening Schemes for Graph Partitioning (Q2828188) (← links)
• A New Lower Bound for the Minimum Linear Arrangement of a Graph (Q3503534) (← links)
• ELRUNA (Q5102051) (← links)
• (Q5140706) (← links)
• Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning (Q5197618) (← links)