scientific article; zbMATH DE number 1769334

DOI10.1002/(SICI)1097-0037(199901)33:1%3C71::AID-NET5%3E3.0.CO;2-3MaRDI QIDQ4540091zbMATH OpenFDO

Authors Akira Matsubayashi, Shuichi Ueno

Publication date 21 July 2002

zbMATH Keywords

hypercubescongestion embedding of graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• The complexity of congestion-1 embedding in a hypercube
• Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$
• Embedding complete binary trees into hypercubes
• Publication:4938676
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees

Cites work

• Efficient Embeddings of Trees in Hypercubes
• Embedding all binary trees in the hypercube
• The complexity of congestion-1 embedding in a hypercube
• Third conference on hypercube concurrent computers and applications
• Universality considerations in VLSI circuits

Cited in

(25)

• A tight bound for congestion of an embedding
• Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
• Embedding hyperpyramids into hypercubes
• Two new classes of trees embeddable into hypercubes
• Spanning tree congestion of the hypercube
• Separator-based graph embedding into multidimensional grids with small edge-congestion
• Efficient Embeddings of Trees in Hypercubes
• Embedding graphs with bounded treewidth into optimal hypercubes
• The treewidth of line graphs
• The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
• Multiple network embeddings into hypercubes
• Embedding digraphs of small size
• On embedding complete graphs into hypercubes
• scientific article; zbMATH DE number 1405694 (Why is no real title available?)
• Improved book-embeddings of incomplete hypercubes
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
• The congestion of generalized cube communication pattern in linear array network
• Efficient Embeddings into Hypercube-like Topologies
• Exact wirelength of hypercubes on a grid
• On embedding graphs in trees
• On the complexity of tree embedding problems
• Embedding of hypercubes into sibling trees
• Embeddings of hyper-rings in hypercubes
• Fixed hypercube embedding
• The congestion of \(n\)-cube layout on a rectangular grid

This page was built for publication:

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