Pages that link to "Item:Q3439448"
From MaRDI portal
The following pages link to Antibandwidth of Complete k-Ary Trees (Q3439448):
Displaying 10 items.
- Tabu search for the cyclic bandwidth problem (Q337475) (← 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 complete \(k\)-ary trees (Q1045176) (← links)
- Bandwidth of the complete \(k\)-ary tree (Q1896357) (← links)
- The maximum \(k\)-differential coloring problem (Q2407949) (← links)
- Antibandwidth and cyclic antibandwidth of Hamming graphs (Q2851478) (← links)
- The Cyclic Antibandwidth Problem (Q3439338) (← links)
- Antibandwidth of Three-Dimensional Meshes (Q3439580) (← links)