Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57782832 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016812993 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1212.2314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Marshals, monotone marshals, and 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: On the Power of k-Consistency / 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: A unified theory of structural tractability for constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree clustering for constraint networks / 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: Connected Treewidth and Connected Graph Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of structural CSP decomposition methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypertree decompositions and tractable queries / 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: Generalized hypertree decompositions: NP-hardness and tractable variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic Characterization of Tree Database Schemas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Projections: Hypergraph Games and Minimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural tractability of enumerating CSP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint solving via fractional edge covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic Hypergraph Projections / 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: Graph searching and a min-max theorem for tree-width / rank
 
Normal rank

Latest revision as of 07:13, 7 July 2024

scientific article
Language Label Description Also known as
English
Tree projections and structural decomposition methods: minimality and game-theoretic characterization
scientific article

    Statements

    Tree projections and structural decomposition methods: minimality and game-theoretic characterization (English)
    0 references
    0 references
    0 references
    24 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    structural decomposition methods
    0 references
    treewidth
    0 references
    generalized hypertree width
    0 references
    games on hypergraphs
    0 references
    computational complexity
    0 references
    Robber and Captain game
    0 references
    0 references
    0 references
    0 references