Pages that link to "Item:Q1025547"
From MaRDI portal
The following pages link to Antibandwidth and cyclic antibandwidth of meshes and hypercubes (Q1025547):
Displaying 24 items.
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- Tabu search for the cyclic bandwidth problem (Q337475) (← links)
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- A special antidilation problem for meshes and Hamming graphs (Q432721) (← links)
- A note on maximum differential coloring of planar graphs (Q473207) (← links)
- Memetic algorithm for the antibandwidth maximization problem (Q623314) (← links)
- Separation numbers of trees (Q837168) (← links)
- Antibandwidth of three-dimensional meshes (Q960961) (← links)
- On explicit formulas for bandwidth and antibandwidth of hypercubes (Q1026164) (← links)
- Antibandwidth of complete \(k\)-ary trees (Q1045176) (← links)
- Scatter search for the cutwidth minimization problem (Q1761768) (← links)
- Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes (Q1887048) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- A note on computational approaches for the antibandwidth problem (Q2051212) (← links)
- A general variable neighborhood search for the cyclic antibandwidth problem (Q2114825) (← links)
- The maximum \(k\)-differential coloring problem (Q2407949) (← links)
- Antibandwidth and cyclic antibandwidth of Hamming graphs (Q2446319) (← links)
- Antibandwidth and cyclic antibandwidth of Hamming graphs (Q2851478) (← links)
- GRASP with path relinking heuristics for the antibandwidth problem (Q3100697) (← links)
- The Cyclic Antibandwidth Problem (Q3439338) (← links)
- Antibandwidth of Three-Dimensional Meshes (Q3439580) (← links)
- Level-based heuristics and hill climbing for the antibandwidth maximization problem (Q4982954) (← links)
- Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)
