Pages that link to "Item:Q4540091"
From MaRDI portal
The following pages link to Small congestion embedding of graphs into hypercubes (Q4540091):
Displaying 23 items.
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321) (← links)
- The treewidth of line graphs (Q723884) (← links)
- Improved book-embeddings of incomplete hypercubes (Q1028113) (← links)
- Exact wirelength of hypercubes on a grid (Q1028121) (← links)
- Spanning tree congestion of the hypercube (Q1045206) (← links)
- On embedding graphs in trees (Q1103631) (← links)
- Fixed hypercube embedding (Q1108043) (← links)
- On the complexity of tree embedding problems (Q1209372) (← links)
- Multiple network embeddings into hypercubes (Q1309213) (← links)
- A probably optimal embedding of hyper-rings in hypercubes (Q1350610) (← links)
- Embedding digraphs of small size (Q1356787) (← links)
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. (Q1401394) (← links)
- On embedding complete graphs into hypercubes (Q1584282) (← links)
- The congestion of \(n\)-cube layout on a rectangular grid (Q1970694) (← links)
- Separator-based graph embedding into multidimensional grids with small edge-congestion (Q2341722) (← links)
- Embedding of hypercubes into sibling trees (Q2449051) (← links)
- The congestion of generalized cube communication pattern in linear array network (Q2929617) (← links)
- Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes (Q3150270) (← links)
- Efficient Embeddings of Trees in Hypercubes (Q3990107) (← links)
- Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$ (Q4288206) (← links)
- Embedding hyperpyramids into hypercubes (Q4313616) (← links)
- Two new classes of trees embeddable into hypercubes (Q5693009) (← links)
- Embeddings of hyper-rings in hypercubes (Q6487978) (← links)
