The following pages link to Power of Natural Semijoins (Q3923637):
Displaying 50 items.
- Towards a characterization of leaf powers by clique arrangements (Q343767) (← links)
- Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
- Finding intersection models: from chordal to Helly circular-arc graphs (Q409451) (← links)
- Characterizing and computing the structure of clique intersections in strongly chordal graphs (Q479046) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- On some partial line graphs of a hypergraph and the associated matroid (Q686485) (← links)
- Cycle structure of edge labelled graphs (Q686524) (← links)
- Hypertree decompositions and tractable queries (Q696962) (← links)
- Querying incomplete information in semistructured data (Q696966) (← links)
- Computing role assignments of chordal graphs (Q708211) (← links)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- Connections in acyclic hypergraphs (Q762180) (← links)
- A characterization of multivalued dependencies equivalent to a join dependency (Q797316) (← links)
- GYO reductions, canonical connections, tree and cyclic schemas, and tree projections (Q801698) (← links)
- Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
- On the complexity of division and set joins in the relational algebra (Q882434) (← links)
- Intersection representations of matrices by subtrees and unicycles on graphs (Q935839) (← links)
- On the power of structural decompositions of graph-based representations of constraint problems (Q969532) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- The clique-separator graph for chordal graphs (Q1026133) (← links)
- On the notion of cycles in hypergraphs (Q1045194) (← links)
- NP-complete problems simplified on tree schemas (Q1056539) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- The tree projection theorem and relational query processing (Q1061514) (← links)
- Representing triangulated graphs in stars (Q1261172) (← links)
- Optimization of a subclass of conjunctive queries (Q1346219) (← links)
- Finding minimum height elimination trees for interval graphs in polynomial time (Q1347072) (← links)
- Clique tree generalization and new subclasses of chordal graphs (Q1348383) (← links)
- Subgraph trees in graph theory (Q1406544) (← links)
- A comparison of structural CSP decomposition methods (Q1589639) (← links)
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
- Clique trees of infinite locally finite chordal graphs (Q1753106) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs (Q1894513) (← links)
- Multigraph representations of hierarchical loglinear models (Q1918460) (← links)
- Graph searches and their end vertices (Q2165035) (← links)
- Structural tractability of enumerating CSP solutions (Q2342585) (← links)
- On the expressive power of semijoin queries (Q2390289) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing. (Q2583532) (← links)
- Complexity and approximability of the happy set problem (Q2662689) (← links)
- The dynamic complexity of acyclic hypergraph homomorphisms (Q2672439) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- Minimum Average Distance Clique Trees (Q2947438) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- Tree Projections: Game Characterization and Computational Aspects (Q3655155) (← links)
- Graph Bisection with Pareto Optimization (Q4577953) (← links)
- A REVIEW OF TREE CONVEX SETS TEST (Q4649838) (← links)
- (Q4917827) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
