Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes

DOI10.1006/JAGM.2002.1217MaRDI QIDQ3150270zbMATH OpenOpenAlexFDO

Authors Volker Heun, Ernst W. Mayr

Publication date 30 September 2002

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.2002.1217

zbMATH Keywords

binary treedynamic embeddinghypercubes

Mathematics Subject Classification ID

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

Recommendations

• Embedding graphs with bounded treewidth into optimal hypercubes
• scientific article; zbMATH DE number 1769334
• On the complexity of tree embedding problems
• Efficient Embeddings of Trees in Hypercubes
• Embeddings Between Hypercubes and Hypertrees

Cited in

(9)

• Demand-aware network designs of bounded degree
• Separator-based graph embedding into multidimensional grids with small edge-congestion
• 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?)
• Embedding graphs with bounded treewidth into optimal hypercubes
• A (1+\varepsilon)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
• Approximately counting embeddings into random graphs
• Discrete preference games with logic-based agents: formal framework, complexity, and islands of tractability

This page was built for publication: Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes

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