Hypertree width and related hypergraph invariants

Hypertree width and related hypergraph invariants

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Adler, I, Gottlob, G, Grohe, M
Formáid:	Journal article
Foilsithe / Cruthaithe:	2007

Míreanna comhchosúla

Hypertree-Width and Related Hypergraph Invariants
de réir: Isolde Adler, et al.
Foilsithe / Cruthaithe: (2005-01-01)

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2001)

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2004)

Hypertree Decompositions: Structure‚ Algorithms‚ and Applications
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2005)

Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2003)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2001)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2001)

Hypertree Decompositions and Tractable Queries
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (1998)

Hypertree Decompositions: A Survey
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2001)

Hypertree Decompositions and Tractable Queries
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2002)

Hypertree Decompositions and Tractable Queries
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (1999)

Hypertree Decompositions and Tractable Queries
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (1999)

Hypertree decompositions: questions and answers
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2016)

Combining hypertree‚ bicomp‚ and hinge decomposition
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2002)

Incremental updates of generalized hypertree decompositions
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2022)

Complexity analysis of generalized and fractional hypertree decompositions
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2021)

A Backtracking−Based Algorithm for Computing Hypertree−Decompositions
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2007)

Generalized hypertree decompositions: np−hardness and tractable variants
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2007)

Generalized hypertree decompositions: np-hardness and tractable variants.
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2007)

On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2007)

General and fractional hypertree decompositions: hard and easy cases
de réir: Fischl, W, et al.
Foilsithe / Cruthaithe: (2018)

General and fractional hypertree decompositions: hard and easy cases
de réir: Fischl, W, et al.
Foilsithe / Cruthaithe: (2018)

Fast parallel hypertree decompositions in logarithmic recursion depth
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2022)

Hypergraph Transversals
de réir: Gottlob, G
Foilsithe / Cruthaithe: (2004)

On cordial labeling of hypertrees
de réir: Michał Tuczyński, et al.
Foilsithe / Cruthaithe: (2019-08-01)

Identifying the Minimal Transversals of a Hypergraph and Related Problems
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1995)

Hypergraph Transversal Computation and Related Problems in Logic and AI
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (2002)

On binary decision hypertree (hyperdiagram)
de réir: Mohammad Hamidi, et al.
Foilsithe / Cruthaithe: (2024-04-01)

PreLie-decorated hypertrees
de réir: Bérénice Oger
Foilsithe / Cruthaithe: (2013-01-01)

Asymptotic Sharpness of Bounds on Hypertrees
de réir: Lin Yi, et al.
Foilsithe / Cruthaithe: (2017-08-01)

Enhancing datalog reasoning with hypertree decompositions
de réir: Zhang, X, et al.
Foilsithe / Cruthaithe: (2023)

The Bounds of the Edge Number in Generalized Hypertrees
de réir: Ke Zhang, et al.
Foilsithe / Cruthaithe: (2018-12-01)

Fractional covers of hypergraphs with bounded multi-intersection
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2023)

How Much of a Hypertree can be Captured by Windmills?
de réir: Liang, Percy, et al.
Foilsithe / Cruthaithe: (2005)

On the Maximum Estrada Index of 3-Uniform Linear Hypertrees
de réir: Faxu Li, et al.
Foilsithe / Cruthaithe: (2014-01-01)

Distance-Based Topological Descriptors on Ternary Hypertree Networks
de réir: Yun Yu, et al.
Foilsithe / Cruthaithe: (2022-01-01)

Note about the upper chromatic number of mixed hypertrees
de réir: Kenneth Roblee, et al.
Foilsithe / Cruthaithe: (2005-10-01)

New Results on Monotone Dualization and Generating Hypergraph Transversals
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (2002)

New results on monotone dualization and generating hypergraph transversals
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (2002)

New Results on Monotone Dualization and Generating Hypergraph Transversals
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (2003)