The following pages link to (Q4414480):
Displaying 12 items.
- Differential geometric treewidth estimation in adiabatic quantum computation (Q332093) (← links)
- Lex M versus MCS-M (Q819832) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Computing a clique tree with the algorithm maximal label search (Q1662609) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- Maximum cardinality search for computing minimal triangulations of graphs (Q1882406) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS (Q2420652) (← links)
- Maximal sub-triangulation in pre-processing phylogenetic data (Q2500753) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q5056146) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710824) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)