Pages that link to "Item:Q4989174"
From MaRDI portal
The following pages link to Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees (Q4989174):
Displaying 5 items.
- Characterization of the congestion lemma on layout computation (Q2051622) (← links)
- Embedding complete multi-partite graphs into Cartesian product of paths and cycles (Q5061707) (← links)
- An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength (Q5084683) (← links)
- On the binary locating-domination number of regular and strongly-regular graphs (Q6200320) (← links)
- Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength (Q6492014) (← links)
