The following pages link to (Q4944976):
Displaying 12 items.
- Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph (Q602684) (← links)
- Efficient enumeration of all minimal separators in a graph (Q1390866) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
- On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
- Graphs with polynomially many minimal separators (Q2664556) (← links)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- (Q5009589) (← links)
- (Q5089189) (← links)
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH (Q5249047) (← links)
- (Q6089677) (← links)