scientific article; zbMATH DE number 1834638
From MaRDI portal
Publication:4779133
zbMath1001.05087MaRDI QIDQ4779133
Francesco Scarcello, Georg Gottlob, Nicola Leone
Publication date: 25 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360037
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Weighted 2-sections and hypergraph reconstruction, Constraint satisfaction with bounded treewidth revisited, Domain permutation reduction for constraint satisfaction problems, Exact algorithms and applications for tree-like Weighted Set Cover, On minimal constraint networks, Space saving by dynamic algebraization based on tree-depth, Satisfiability of acyclic and almost acyclic CNF formulas, On Sparse Discretization for Graphical Games, A unified theory of structural tractability for constraint satisfaction problems, Enhancing context knowledge repositories with justifiable exceptions, A combinatorial approach to nonlocality and contextuality, Optimizing Answer Set Computation via Heuristic-Based Decomposition, Undirected Graphs of Entanglement 2, Schema Mappings: A Case of Logical Dynamics in Database Theory, Large hypertree width for sparse random hypergraphs
