Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes

DOI10.1016/j.dam.2024.12.001MaRDI QIDQ6671397

Lan Lin, Yanpei Liu

Publication date: 27 January 2025

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

bandwidthtreewidthhypercubespathwidthgraph numbering

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Odd and even Hamming spheres also have minimum boundary
• The treewidth and pathwidth of hypercubes
• On explicit formulas for bandwidth and antibandwidth of hypercubes
• Graph minors. I. Excluding a forest
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• A short proof for a theorem of Harper about Hamming-spheres
• A partial k-arboretum of graphs with bounded treewidth
• Two improved algorithms for envelope and wavefront reduction
• Weak-quasi-bandwidth and forward-bandwidth of graphs
• A note on Hamming spheres
• Nonserial dynamic programming
• Graph minors. II. Algorithmic aspects of tree-width
• Algorithmic Aspects of Vertex Elimination on Graphs
• Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
• Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
• Optimal numberings and isoperimetric problems on graphs

This page was built for publication: Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes