Combining hypertree‚ bicomp‚ and hinge decomposition

Combining hypertree‚ bicomp‚ and hinge decomposition

Библиографические подробности
Главные авторы:	Gottlob, G, Hutle, M, Wotawa, F
Формат:	Conference item
Опубликовано:	IOS Press 2002

Схожие документы

Hypertree Decompositions and Tractable Queries
по: Gottlob, G, и др.
Опубликовано: (2002)

Hypertree Decompositions and Tractable Queries
по: Gottlob, G, и др.
Опубликовано: (1998)

Hypertree Decompositions: A Survey
по: Gottlob, G, и др.
Опубликовано: (2001)

Hypertree Decompositions and Tractable Queries
по: Gottlob, G, и др.
Опубликовано: (1999)

Hypertree Decompositions and Tractable Queries
по: Gottlob, G, и др.
Опубликовано: (1999)

Hypertree decompositions: questions and answers
по: Gottlob, G, и др.
Опубликовано: (2016)

Hypertree Decompositions: Structure‚ Algorithms‚ and Applications
по: Gottlob, G, и др.
Опубликовано: (2005)

Incremental updates of generalized hypertree decompositions
по: Gottlob, G, и др.
Опубликовано: (2022)

A Backtracking−Based Algorithm for Computing Hypertree−Decompositions
по: Gottlob, G, и др.
Опубликовано: (2007)

Complexity analysis of generalized and fractional hypertree decompositions
по: Gottlob, G, и др.
Опубликовано: (2021)

Generalized hypertree decompositions: np−hardness and tractable variants
по: Gottlob, G, и др.
Опубликовано: (2007)

Generalized hypertree decompositions: np-hardness and tractable variants.
по: Gottlob, G, и др.
Опубликовано: (2007)

General and fractional hypertree decompositions: hard and easy cases
по: Fischl, W, и др.
Опубликовано: (2018)

General and fractional hypertree decompositions: hard and easy cases
по: Fischl, W, и др.
Опубликовано: (2018)

Fast parallel hypertree decompositions in logarithmic recursion depth
по: Gottlob, G, и др.
Опубликовано: (2022)

On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
по: Gottlob, G, и др.
Опубликовано: (2007)

Enhancing datalog reasoning with hypertree decompositions
по: Zhang, X, и др.
Опубликовано: (2023)

Hypertree width and related hypergraph invariants
по: Adler, I, и др.
Опубликовано: (2007)

Hypertree-Width and Related Hypergraph Invariants
по: Isolde Adler, и др.
Опубликовано: (2005-01-01)

Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width
по: Gottlob, G, и др.
Опубликовано: (2003)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
по: Gottlob, G, и др.
Опубликовано: (2001)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
по: Gottlob, G, и др.
Опубликовано: (2001)

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width
по: Gottlob, G, и др.
Опубликовано: (2001)

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width
по: Gottlob, G, и др.
Опубликовано: (2004)

On cordial labeling of hypertrees
по: Michał Tuczyński, и др.
Опубликовано: (2019-08-01)

On binary decision hypertree (hyperdiagram)
по: Mohammad Hamidi, и др.
Опубликовано: (2024-04-01)

PreLie-decorated hypertrees
по: Bérénice Oger
Опубликовано: (2013-01-01)

Asymptotic Sharpness of Bounds on Hypertrees
по: Lin Yi, и др.
Опубликовано: (2017-08-01)

The Bounds of the Edge Number in Generalized Hypertrees
по: Ke Zhang, и др.
Опубликовано: (2018-12-01)

BiComp-DTA: Drug-target binding affinity prediction through complementary biological-related and compression-based featurization approach.
по: Mahmood Kalemati, и др.
Опубликовано: (2023-03-01)

How Much of a Hypertree can be Captured by Windmills?
по: Liang, Percy, и др.
Опубликовано: (2005)

On the Maximum Estrada Index of 3-Uniform Linear Hypertrees
по: Faxu Li, и др.
Опубликовано: (2014-01-01)

Distance-Based Topological Descriptors on Ternary Hypertree Networks
по: Yun Yu, и др.
Опубликовано: (2022-01-01)

Note about the upper chromatic number of mixed hypertrees
по: Kenneth Roblee, и др.
Опубликовано: (2005-10-01)

Bounds on the Number of Edges of Edge-Minimal, Edge-Maximal and L-Hypertrees
по: Szabó Péter G.N.
Опубликовано: (2016-05-01)

A proof of the Elliott–Rödl conjecture on hypertrees in Steiner triple systems
по: Seonghyuk Im, и др.
Опубликовано: (2024-01-01)

Rainbow connection numbers of some classes of s-overlapping r-uniform hypertrees with size t
по: Sitta Alief Farihati, и др.
Опубликовано: (2024-06-01)

Hinged Dissections Exist
по: Abbott, Timothy G., и др.
Опубликовано: (2011)

Static and dynamic analyses of free-hinged-hinged-hinged-free beam in non-homogeneous gravitational field: application to gravity gradiometry
по: Alexey V. Veryaskin, и др.
Опубликовано: (2022-05-01)

A Comparison of Structural CSP Decomposition Methods
по: Gottlob, G, и др.
Опубликовано: (1999)