Pages that link to "Item:Q3508553"
From MaRDI portal
The following pages link to Tree-Width and Optimization in Bounded Degree Graphs (Q3508553):
Displaying 14 items.
- Trimming weighted graphs of bounded treewidth (Q415289) (← links)
- Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs (Q976141) (← links)
- Resource allocation in bounded degree trees (Q1024215) (← links)
- Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth (Q1041722) (← links)
- Graph searching and a min-max theorem for tree-width (Q1325271) (← links)
- Tree-edges deletion problems with bounded diameter obstruction sets (Q2370427) (← links)
- Tree-width and circumference of graphs (Q4808403) (← links)
- Canonizing Graphs of Bounded Tree Width in Logspace (Q4973889) (← links)
- Optimal parametric search on graphs of bounded tree-width (Q5056174) (← links)
- Treewidth of display graphs: bounds, brambles and applications (Q5233142) (← links)
- (Q5365080) (← links)
- (Q5461460) (← links)
