The following pages link to Safe separators for treewidth (Q819825):
Displayed 12 items.
- Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph (Q602684) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Safe separators for treewidth (Q819825) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q3012824) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone (Q5323088) (← links)