Pages that link to "Item:Q1801670"
From MaRDI portal
The following pages link to On the complexity of the embedding problem for hypercube related graphs (Q1801670):
Displaying 7 items.
- Embedding of hypercubes into necklace, windmill and snake graphs (Q436587) (← links)
- A polynomial time approximation scheme for embedding a directed hypergraph on a ring (Q1045935) (← links)
- Fixed hypercube embedding (Q1108043) (← links)
- On embedding complete graphs into hypercubes (Q1584282) (← links)
- On embedding of a hypercube in a completely overlapping network (Q2272202) (← links)
- (Q3739138) (← links)
- High-Speed and Noise-Robust Embedding of Hypergraphs Based on Double-Centered Incidence Matrix (Q5050372) (← links)