scientific article; zbMATH DE number 1769334

DOI<71::AID-NET5>3.0.CO;2-3 10.1002/(SICI)1097-0037(199901)33:1<71::AID-NET5>3.0.CO;2-3zbMath0990.05036MaRDI QIDQ4540091

Akira Matsubayashi, Shuichi Ueno

Publication date: 21 July 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

hypercubescongestion embedding of graphs

Mathematics Subject Classification ID

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

Related Items (5)

The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. ⋮ Minimum average congestion of enhanced and augmented hypercubes into complete binary trees ⋮ The treewidth of line graphs ⋮ Exact wirelength of hypercubes on a grid ⋮ Separator-based graph embedding into multidimensional grids with small edge-congestion

Cites Work

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

This page was built for publication: