Combining hypertree‚ bicomp‚ and hinge decomposition

Combining hypertree‚ bicomp‚ and hinge decomposition

Detalles Bibliográficos
Main Authors:	Gottlob, G, Hutle, M, Wotawa, F
Formato:	Conference item
Publicado:	IOS Press 2002

Títulos similares

Hypertree Decompositions and Tractable Queries
por: Gottlob, G, et al.
Publicado: (2002)

Hypertree Decompositions and Tractable Queries
por: Gottlob, G, et al.
Publicado: (1998)

Hypertree Decompositions: A Survey
por: Gottlob, G, et al.
Publicado: (2001)

Hypertree Decompositions and Tractable Queries
por: Gottlob, G, et al.
Publicado: (1999)

Hypertree Decompositions and Tractable Queries
por: Gottlob, G, et al.
Publicado: (1999)

Hypertree decompositions: questions and answers
por: Gottlob, G, et al.
Publicado: (2016)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

PreLie-decorated hypertrees
por: Bérénice Oger
Publicado: (2013-01-01)

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

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

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

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

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

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

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

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

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

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

Hinged Dissections Exist
por: Abbott, Timothy G., et al.
Publicado: (2011)

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

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