Hypertree width and related hypergraph invariants

Hypertree width and related hypergraph invariants

Bibliografske podrobnosti
Main Authors:	Adler, I, Gottlob, G, Grohe, M
Format:	Journal article
Izdano:	2007

Podobne knjige/članki

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

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

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

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

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

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

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

Hypertree Decompositions and Tractable Queries
od: Gottlob, G, et al.
Izdano: (1998)

Hypertree Decompositions: A Survey
od: Gottlob, G, et al.
Izdano: (2001)

Hypertree Decompositions and Tractable Queries
od: Gottlob, G, et al.
Izdano: (2002)

Hypertree Decompositions and Tractable Queries
od: Gottlob, G, et al.
Izdano: (1999)

Hypertree Decompositions and Tractable Queries
od: Gottlob, G, et al.
Izdano: (1999)

Hypertree decompositions: questions and answers
od: Gottlob, G, et al.
Izdano: (2016)

Combining hypertree‚ bicomp‚ and hinge decomposition
od: Gottlob, G, et al.
Izdano: (2002)

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

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

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

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

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

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

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

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

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

Hypergraph Transversals
od: Gottlob, G
Izdano: (2004)

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

Identifying the Minimal Transversals of a Hypergraph and Related Problems
od: Eiter, T, et al.
Izdano: (1995)

Hypergraph Transversal Computation and Related Problems in Logic and AI
od: Eiter, T, et al.
Izdano: (2002)

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

PreLie-decorated hypertrees
od: Bérénice Oger
Izdano: (2013-01-01)

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

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

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

Fractional covers of hypergraphs with bounded multi-intersection
od: Gottlob, G, et al.
Izdano: (2023)

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

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

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

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

New Results on Monotone Dualization and Generating Hypergraph Transversals
od: Eiter, T, et al.
Izdano: (2002)

New results on monotone dualization and generating hypergraph transversals
od: Eiter, T, et al.
Izdano: (2002)

New Results on Monotone Dualization and Generating Hypergraph Transversals
od: Eiter, T, et al.
Izdano: (2003)