Pages that link to "Item:Q3150270"

The following pages link to Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes (Q3150270):

Displaying 8 items.

• Demand-aware network designs of bounded degree (Q2189175) (← links)
• Separator-based graph embedding into multidimensional grids with small edge-congestion (Q2341722) (← links)
• A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q3448808) (← links)
• Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs (Q3588402) (← links)
• (Q4027193) (← links)
• A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q5376438) (← links)
• Approximately Counting Embeddings into Random Graphs (Q5891884) (← links)
• Discrete preference games with logic-based agents: formal framework, complexity, and islands of tractability (Q6579293) (← links)