Degrees of acyclicity for hypergraphs and relational database schemes
From MaRDI portal
(Redirected from Publication:3026383)
Recommendations
Cited in
(only showing first 100 items - show all)- The minimal hitting set generation problem: algorithms and computation
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Characterization of desirable properties of general database decompositions.
- Belief merging by examples
- Ramsey numbers of Berge-hypergraphs and related structures
- scientific article; zbMATH DE number 1782575 (Why is no real title available?)
- NP-complete problems simplified on tree schemas
- On optimization problems in acyclic hypergraphs
- On the existence of acyclic views in a database scheme
- Optimal distributed execution of join queries
- On acyclic database decompositions
- Generating hinges from arbitrary subhypergraphs
- Inferring null join dependencies in relational databases
- Hypergraph incidence coloring
- Enumeration and updates for conjunctive linear algebra queries through expressibility
- A hypergraph on modules and singularity condition
- Finding smallest witnesses for conjunctive queries
- Evaluating Datalog via tree automata and cycluits
- The parallel solution of domination problems on chordal and strongly chordal graphs
- Computing partial hypergraphs of bounded width
- scientific article; zbMATH DE number 3876623 (Why is no real title available?)
- The colorful Helly theorem and general hypergraphs
- On the cut-vertex and the interval transit functions of hypergraphs
- Modeling Hypergraphs with Diversity and Heterogeneous Popularity
- Union closed tree convex sets
- Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons
- How to draw a hypergraph
- The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
- GYO reductions, canonical connections, tree and cyclic schemas, and tree projections
- Recognizing different types of beta-cycles in a database scheme
- On the Desirability of Acyclic Database Schemes
- On the Galois Lattice of Bipartite Distance Hereditary Graphs
- Applying a hypergraph to determine the structure of some finite modules
- Laminar structure of ptolemaic graphs with applications
- Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent
- Fast parallel hypertree decompositions in logarithmic recursion depth
- Querying geometric figures using a controlled language, ontological graphs and dependency lattices
- Characterization of optimal complements of database views defined by projection
- Consistency checking and querying in probabilistic databases under integrity constraints
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Closures of database hypergraphs
- Fast and parallel decomposition of constraint satisfaction problems
- Entity-relationship diagrams which are in BCNF
- A faster algorithm to recognize undirected path graphs
- scientific article; zbMATH DE number 1138293 (Why is no real title available?)
- Tree projections and structural decomposition methods: minimality and game-theoretic characterization
- The existence condition of \(\gamma\)-acyclic database schemes with MVDs constraints.
- scientific article; zbMATH DE number 3876650 (Why is no real title available?)
- Ramsey numbers of Berge-hypergraphs and related structures
- Indiscernibility structures induced from function sets: graph and digraph case
- Decomposing the feasibility of clustered spanning tree by paths
- Cycle structure of edge labelled graphs
- On some partial line graphs of a hypergraph and the associated matroid
- On the Galois lattice of bipartite distance hereditary graphs
- An algorithm for handling many relational calculus queries efficiently.
- On the strength of recursive McCormick relaxations for binary polynomial optimization
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time
- Allocating relations in a distributed database system
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences
- Equivalence between hypergraph convexities
- Subdivision Drawings of Hypergraphs
- Tractability beyond -acyclicity for conjunctive queries with negation and SAT
- Characterizing and computing the structure of clique intersections in strongly chordal graphs
- Optimising the distributed execution of join queries in polynomial time
- Prediction-hardness of acyclic conjunctive queries
- scientific article; zbMATH DE number 4045143 (Why is no real title available?)
- Satisfiability of acyclic and almost acyclic CNF formulas
- Tractable counting of the answers to conjunctive queries
- The complexity of weighted counting for acyclic conjunctive queries
- Hypergraph modeling and visualisation of complex co-occurence networks
- Block-wise construction of tree-like relational features with monotone reducibility and redundancy
- A hybrid tractable class for non-binary CSPs
- Reformulation of global constraints based on constraints checkers
- A characterization of finite fd-acyclicity
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
- Interaction-free multivalued dependency sets
- On the desirability of \(\gamma\)-acyclic BCNF database schemes
- Hypertree decompositions and tractable queries
- Hierarchical fault diagnosis for discrete-event systems under global consistency
- Coding theory motivated by relational databases
- Canonical and monophonic convexities in hypergraphs
- scientific article; zbMATH DE number 3881903 (Why is no real title available?)
- Satisfiability of acyclic and almost acyclic CNF formulas. II
- On hypergraph acyclicity and graph chordality
- Relational decomposition and structural analysis of systems
- A survey of simplicial, relative, and chain complex homology theories for hypergraphs
- A fast algorithm for query optimization in universal-relation databases
- Lossless outer joins with incomplete information
- A note on odd/even cycles
- scientific article; zbMATH DE number 7561421 (Why is no real title available?)
- Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs
- Berge-acyclic multilinear 0-1 optimization problems
- Decomposing constraint satisfaction problems using database techniques
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
- A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs
- UNCERTAINTY AND ESTIMATION IN RECONSTRUCTABILITY ANALYSIS
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
- On winning strategies in Ehrenfeucht-Fraïssé games
- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
This page was built for publication: Degrees of acyclicity for hypergraphs and relational database schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3026383)
