Embedding hypergraph in trees of rings

MaRDI QIDQ3611020zbMATH OpenFDO

Authors Qi Wang, Xiu Heng Zhao, Guojun Li

Publication date 6 March 2009

zbMATH Keywords

embedding hypergraph in trees of ringshypergraphminimum-congestion hypergraph embedding in a cycletrees of ringsunderlying tree

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Hypergraphs (05C65)

Recommendations

• High Performance Computing - HiPC 2003
• Automata, Languages and Programming
• A polynomial time approximation scheme for embedding hypergraph in a weighted cycle
• A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
• A polynomial time approximation scheme for embedding hypergraph in a weighted cycle

Cited in

(4)

• A polynomial time approximation scheme for embedding a directed hypergraph on a ring
• Embedding trees in recursive circulants
• A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
• The embedding of rings and meshes into \(\text{RP} (k)\) networks

This page was built for publication: Embedding hypergraph in trees of rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611020)