Pages that link to "Item:Q4248532"
From MaRDI portal
The following pages link to A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs (Q4248532):
Displaying 13 items.
- THE GRAPH-BIN PACKING PROBLEM (Q3224960) (← links)
- Edge Addition Number of Cartesian Product of Paths and Cycles (Q3439378) (← links)
- Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
- Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees (Q4989174) (← links)
- A Result on the Strength of Graphs by Factorizations of Complete Graphs (Q5051422) (← links)
- A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees (Q5283240) (← links)
- On semidefinite programming bounds for graph bandwidth (Q5299908) (← links)
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem (Q6106765) (← links)
- Minimum Linear Arrangement of Generalized Sierpinski Graphs (Q6181951) (← links)
- Embedding Wheel - like Networks (Q6187747) (← links)
- Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength (Q6492014) (← links)
- Embedding augmented cube into certain trees and windmill graphs (Q6554734) (← links)
- Hardness and approximation of submodular minimum linear ordering problems (Q6634527) (← links)