Pages that link to "Item:Q3751595"
From MaRDI portal
The following pages link to Complexity of Finding Embeddings in a <i>k</i>-Tree (Q3751595):
Displaying 9 items.
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Complexity of secure sets (Q722534) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- Tractability of most probable explanations in multidimensional Bayesian network classifiers (Q1726375) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
- A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
- On the Maximum Weight Minimal Separator (Q2988830) (← links)
- Parallel algorithms with optimal speedup for bounded treewidth (Q4645184) (← links)
