Pages that link to "Item:Q3167381"
From MaRDI portal
The following pages link to Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems (Q3167381):
Displaying 6 items.
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- Lower bounds for treewidth of product graphs (Q741743) (← links)
- Tight inapproximability of minimum maximal matching on bipartite graphs and related problems (Q2085735) (← links)
- The red-blue pebble game on trees and DAGs with large input (Q2097342) (← links)
- A \(c^k n\) 5-approximation algorithm for treewidth (Q2799353) (← links)
- (Q5090422) (← links)