The following pages link to (Q4036592):
Displaying 23 items.
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Peptide sequencing via graph path decomposition (Q528747) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- Mixed searching and proper-path-width (Q674341) (← links)
- Efficient sets in partial \(k\)-trees (Q686252) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- Complexity of path-forming games (Q1210546) (← links)
- Scheduling with incompatible jobs (Q1343141) (← links)
- The complexity of broadcasting in planar and decomposable graphs (Q1392535) (← links)
- Better \(s-t\)-tours by Gao trees (Q1800996) (← links)
- Computing Pathwidth Faster Than 2 n (Q3656873) (← links)
- Treewidth and pathwidth of permutation graphs (Q4630253) (← links)
- Parallel algorithms with optimal speedup for bounded treewidth (Q4645184) (← links)
- (Q5028484) (← links)
- Computing Tree Decompositions (Q5042458) (← links)
- Testing superperfection of k-trees (Q5056149) (← links)
- A simple linear time algorithm for triangulating three-colored graphs (Q5096799) (← links)
- Minor-Closed Graph Classes with Bounded Layered Pathwidth (Q5130575) (← links)
- Two strikes against perfect phylogeny (Q5204323) (← links)
- (Q5743430) (← links)
- Tree-width and path-width of comparability graphs of interval orders (Q6184354) (← links)
- The complexity of broadcasting in planar and decomposable graphs (Q6184371) (← links)
