The following pages link to (Q4540091):
Displaying 5 items.
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321) (← links)
- The treewidth of line graphs (Q723884) (← links)
- Exact wirelength of hypercubes on a grid (Q1028121) (← links)
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. (Q1401394) (← links)
- Separator-based graph embedding into multidimensional grids with small edge-congestion (Q2341722) (← links)
