Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5897539
DOI10.1007/11604686zbMath1126.68516MaRDI QIDQ5897539
Nysret Musliu, Martin Grohe, Francesco Scarcello, Marko Samer, Georg Gottlob
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (12)
Constraint satisfaction with bounded treewidth revisited ⋮ It's all a matter of degree. Using degree information to optimize multiway joins ⋮ Sum-of-Products with Default Values: Algorithms and Complexity Results ⋮ Weighted hypertree decompositions and optimal query plans ⋮ Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs ⋮ Computing optimal hypertree decompositions with SAT ⋮ An annotated bibliography on guaranteed graph searching ⋮ Hypertree width and related hypergraph invariants ⋮ Efficiently enumerating minimal triangulations ⋮ Optimizing Answer Set Computation via Heuristic-Based Decomposition ⋮ Uniform Constraint Satisfaction Problems and Database Theory ⋮ Myhill-Nerode Methods for Hypergraphs
This page was built for publication: Graph-Theoretic Concepts in Computer Science
