Embedding complete binary trees into star and Pancake graphs

DOI10.1007/S002240000089MaRDI QIDQ1387827zbMATH OpenOpenAlexFDO

Authors D. Massart, A. Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, D. Sotteau

Publication date 8 June 1998

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002240000089

zbMATH Keywords

embeddingpancake graphsundirected graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Embedding complete binary trees into star networks
• Congestion-free, dilation-2 embedding of complete binary trees into star graphs
• Embedding an arbitrary binary tree into the star graph
• Optimal embedding of complete binary trees into lines and grids
• scientific article; zbMATH DE number 219230

Cited in

(12)

• Ring embedding in faulty pancake graphs
• On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network
• Largest connected component of a star graph with faulty vertices
• Cost Trade-offs in Graph Embeddings, with Applications
• Congestion-free, dilation-2 embedding of complete binary trees into star graphs
• scientific article; zbMATH DE number 1953271 (Why is no real title available?)
• Embedding an arbitrary binary tree into the star graph
• Embedding complete binary trees into star networks
• Embedding of K_r+K^c_s and K_r+P_s into arbitrary trees
• The super connectivity of the pancake graphs and the super laceability of the star graphs
• One-to-many embeddings of hypercubes into Cayley graphs generated by reversals
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees

This page was built for publication: Embedding complete binary trees into star and Pancake graphs

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