Embedding graphs with bounded treewidth into optimal hypercubes

DOI10.1007/3-540-60922-9_14MaRDI QIDQ4593926zbMATH OpenOpenAlexFDO

Authors Volker Heun, Ernst W. Mayr

Publication date 16 November 2017

Published in STACS 96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60922-9_14

Mathematics Subject Classification ID

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

Recommendations

• Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
• Efficient Embeddings into Hypercube-like Topologies
• Efficient Embeddings of Trees in Hypercubes
• Embeddings of hypercubes and grids into de Bruijn graphs
• scientific article; zbMATH DE number 1769334

Cited in

(6)

• Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
• A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
• Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
• scientific article; zbMATH DE number 125491 (Why is no real title available?)
• Efficient Embeddings into Hypercube-like Topologies
• A (1+\varepsilon)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs

This page was built for publication: Embedding graphs with bounded treewidth into optimal hypercubes

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