Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2016.11.004 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: EmptyHeaded / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2326948987 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1603.09617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of acyclicity for hypergraphs and relational database schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypertree decompositions and tractable queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint solving via fractional edge covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified theory of structural tractability for constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized hypertree decompositions: NP-hardness and tractable variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tree projection theorem and relational query processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree projections and structural decomposition methods: minimality and game-theoretic characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating fractional hypertree width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power of Natural Semijoins / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of structural decompositions of graph-based representations of constraint problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypertree width and related hypergraph invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-Related Widths of Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5469338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mixed multi-unit combinatorial auctions: tractability under structural and qualitative restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compressed Generalized Hypertree Decomposition-based solving technique for non-binary Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of acyclic conjunctive queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: GYM: A Multiround Distributed Join Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid tractability of valued constraint problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Marshals, monotone marshals, and hypertree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph searching and a min-max theorem for tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-to-vertex pursuit in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and robbers is EXPTIME-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pursuit on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and Robber with Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of a game of cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and robbers in graphs with large girth and Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game of cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and robbers on intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pursuing a fast robber on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chasing a Fast Robber on Planar Graphs and Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of zero-visibility cops and robber / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2016.11.004 / rank
 
Normal rank

Latest revision as of 02:17, 10 December 2024

scientific article
Language Label Description Also known as
English
Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
scientific article

    Statements

    Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (English)
    0 references
    0 references
    0 references
    22 December 2016
    0 references
    structural decomposition methods
    0 references
    games on discrete structures
    0 references
    conjunctive queries
    0 references
    databases
    0 references
    constraint satisfaction problems
    0 references
    hypertree decompositions
    0 references
    tree projections
    0 references
    homomorphism problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references