Pages that link to "Item:Q5897539"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5897539):
Displaying 12 items.
- Constraint satisfaction with bounded treewidth revisited (Q847262) (← links)
- Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- It's all a matter of degree. Using degree information to optimize multiway joins (Q1650915) (← links)
- Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs (Q1929213) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- Hypertree width and related hypergraph invariants (Q2461773) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- Optimizing Answer Set Computation via Heuristic-Based Decomposition (Q4957190) (← links)
- Sum-of-Products with Default Values: Algorithms and Complexity Results (Q5076308) (← links)
- Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
- Computing optimal hypertree decompositions with SAT (Q6067037) (← links)
