Combining hypertree‚ bicomp‚ and hinge decomposition

Combining hypertree‚ bicomp‚ and hinge decomposition

Bibliografiska uppgifter
Huvudupphovsmän:	Gottlob, G, Hutle, M, Wotawa, F
Materialtyp:	Conference item
Publicerad:	IOS Press 2002

Liknande verk

Hypertree Decompositions and Tractable Queries
av: Gottlob, G, et al.
Publicerad: (2002)

Hypertree Decompositions and Tractable Queries
av: Gottlob, G, et al.
Publicerad: (1998)

Hypertree Decompositions: A Survey
av: Gottlob, G, et al.
Publicerad: (2001)

Hypertree Decompositions and Tractable Queries
av: Gottlob, G, et al.
Publicerad: (1999)

Hypertree Decompositions and Tractable Queries
av: Gottlob, G, et al.
Publicerad: (1999)

Hypertree decompositions: questions and answers
av: Gottlob, G, et al.
Publicerad: (2016)

Hypertree Decompositions: Structure‚ Algorithms‚ and Applications
av: Gottlob, G, et al.
Publicerad: (2005)

Incremental updates of generalized hypertree decompositions
av: Gottlob, G, et al.
Publicerad: (2022)

A Backtracking−Based Algorithm for Computing Hypertree−Decompositions
av: Gottlob, G, et al.
Publicerad: (2007)

Complexity analysis of generalized and fractional hypertree decompositions
av: Gottlob, G, et al.
Publicerad: (2021)

Generalized hypertree decompositions: np−hardness and tractable variants
av: Gottlob, G, et al.
Publicerad: (2007)

Generalized hypertree decompositions: np-hardness and tractable variants.
av: Gottlob, G, et al.
Publicerad: (2007)

General and fractional hypertree decompositions: hard and easy cases
av: Fischl, W, et al.
Publicerad: (2018)

General and fractional hypertree decompositions: hard and easy cases
av: Fischl, W, et al.
Publicerad: (2018)

Fast parallel hypertree decompositions in logarithmic recursion depth
av: Gottlob, G, et al.
Publicerad: (2022)

On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
av: Gottlob, G, et al.
Publicerad: (2007)

Enhancing datalog reasoning with hypertree decompositions
av: Zhang, X, et al.
Publicerad: (2023)

Hypertree width and related hypergraph invariants
av: Adler, I, et al.
Publicerad: (2007)

Hypertree-Width and Related Hypergraph Invariants
av: Isolde Adler, et al.
Publicerad: (2005-01-01)

Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width
av: Gottlob, G, et al.
Publicerad: (2003)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
av: Gottlob, G, et al.
Publicerad: (2001)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
av: Gottlob, G, et al.
Publicerad: (2001)

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width
av: Gottlob, G, et al.
Publicerad: (2001)

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width
av: Gottlob, G, et al.
Publicerad: (2004)

On cordial labeling of hypertrees
av: Michał Tuczyński, et al.
Publicerad: (2019-08-01)

On binary decision hypertree (hyperdiagram)
av: Mohammad Hamidi, et al.
Publicerad: (2024-04-01)

PreLie-decorated hypertrees
av: Bérénice Oger
Publicerad: (2013-01-01)

Asymptotic Sharpness of Bounds on Hypertrees
av: Lin Yi, et al.
Publicerad: (2017-08-01)

The Bounds of the Edge Number in Generalized Hypertrees
av: Ke Zhang, et al.
Publicerad: (2018-12-01)

BiComp-DTA: Drug-target binding affinity prediction through complementary biological-related and compression-based featurization approach.
av: Mahmood Kalemati, et al.
Publicerad: (2023-03-01)

How Much of a Hypertree can be Captured by Windmills?
av: Liang, Percy, et al.
Publicerad: (2005)

On the Maximum Estrada Index of 3-Uniform Linear Hypertrees
av: Faxu Li, et al.
Publicerad: (2014-01-01)

Distance-Based Topological Descriptors on Ternary Hypertree Networks
av: Yun Yu, et al.
Publicerad: (2022-01-01)

Note about the upper chromatic number of mixed hypertrees
av: Kenneth Roblee, et al.
Publicerad: (2005-10-01)

Bounds on the Number of Edges of Edge-Minimal, Edge-Maximal and L-Hypertrees
av: Szabó Péter G.N.
Publicerad: (2016-05-01)

A proof of the Elliott–Rödl conjecture on hypertrees in Steiner triple systems
av: Seonghyuk Im, et al.
Publicerad: (2024-01-01)

Rainbow connection numbers of some classes of s-overlapping r-uniform hypertrees with size t
av: Sitta Alief Farihati, et al.
Publicerad: (2024-06-01)

Hinged Dissections Exist
av: Abbott, Timothy G., et al.
Publicerad: (2011)

Static and dynamic analyses of free-hinged-hinged-hinged-free beam in non-homogeneous gravitational field: application to gravity gradiometry
av: Alexey V. Veryaskin, et al.
Publicerad: (2022-05-01)

A Comparison of Structural CSP Decomposition Methods
av: Gottlob, G, et al.
Publicerad: (1999)