Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width

Afficher d'autres versions (1)

Détails bibliographiques
Auteurs principaux:	Gottlob, G, Pichler, R
Format:	Journal article
Publié:	2004

Documents similaires

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width
par: Gottlob, G, et autres
Publié: (2001)

Hypertree width and related hypergraph invariants
par: Adler, I, et autres
Publié: (2007)

Hypertree-Width and Related Hypergraph Invariants
par: Isolde Adler, et autres
Publié: (2005-01-01)

Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width
par: Gottlob, G, et autres
Publié: (2003)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
par: Gottlob, G, et autres
Publié: (2001)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
par: Gottlob, G, et autres
Publié: (2001)

General and fractional hypertree decompositions: hard and easy cases
par: Fischl, W, et autres
Publié: (2018)

General and fractional hypertree decompositions: hard and easy cases
par: Fischl, W, et autres
Publié: (2018)

Complexity analysis of generalized and fractional hypertree decompositions
par: Gottlob, G, et autres
Publié: (2021)

Fast parallel hypertree decompositions in logarithmic recursion depth
par: Gottlob, G, et autres
Publié: (2022)

Hypertree Decompositions and Tractable Queries
par: Gottlob, G, et autres
Publié: (1998)

Hypertree Decompositions: A Survey
par: Gottlob, G, et autres
Publié: (2001)

Hypertree Decompositions and Tractable Queries
par: Gottlob, G, et autres
Publié: (2002)

Hypertree Decompositions and Tractable Queries
par: Gottlob, G, et autres
Publié: (1999)

Hypertree Decompositions and Tractable Queries
par: Gottlob, G, et autres
Publié: (1999)

Hypertree decompositions: questions and answers
par: Gottlob, G, et autres
Publié: (2016)

Combining hypertree‚ bicomp‚ and hinge decomposition
par: Gottlob, G, et autres
Publié: (2002)

Covering the Edges of a Random Hypergraph by Cliques
par: Rödl Vojtěch, et autres
Publié: (2022-11-01)

Incremental updates of generalized hypertree decompositions
par: Gottlob, G, et autres
Publié: (2022)

P 6- and triangle-free graphs revisited: structure and bounded clique-width
par: Andreas Brandstädt, et autres
Publié: (2006-01-01)

Semantic width and the fixed-parameter tractability of constraint satisfaction problems
par: Chen, H, et autres
Publié: (2020)

Hypertree Decompositions: Structure‚ Algorithms‚ and Applications
par: Gottlob, G, et autres
Publié: (2005)

A Backtracking−Based Algorithm for Computing Hypertree−Decompositions
par: Gottlob, G, et autres
Publié: (2007)

Generalized hypertree decompositions: np−hardness and tractable variants
par: Gottlob, G, et autres
Publié: (2007)

Generalized hypertree decompositions: np-hardness and tractable variants.
par: Gottlob, G, et autres
Publié: (2007)

On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
par: Gottlob, G, et autres
Publié: (2007)

The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
par: Boix-Adserà, Enric, et autres
Publié: (2022)

The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
par: Boix-Adsera, Enric, et autres
Publié: (2021)

HyperConsistency Width For Constraint Satisfaction
par: Marnette, B, et autres
Publié: (2009)

Inapproximability of Rank, Clique, Boolean, and Maximum Induced Matching-Widths under Small Set Expansion Hypothesis
par: Koichi Yamazaki
Publié: (2018-10-01)

Arboricity : an acyclic hypergraph decomposition problem motivated by database theory
par: Chee, Yeow Meng, et autres
Publié: (2013)

Fractional covers of hypergraphs with bounded multi-intersection
par: Gottlob, G, et autres
Publié: (2023)

Hypergraph Transversals
par: Gottlob, G
Publié: (2004)

Sharp Bounds on the Spectral Radii of Uniform Hypergraphs concerning Diameter or Clique Number
par: Qiannan Niu, et autres
Publié: (2021-01-01)

On cordial labeling of hypertrees
par: Michał Tuczyński, et autres
Publié: (2019-08-01)

HyperBench: A benchmark and tool for hypergraphs and empirical findings
par: Fischl, W, et autres
Publié: (2019)

On binary decision hypertree (hyperdiagram)
par: Mohammad Hamidi, et autres
Publié: (2024-04-01)

PreLie-decorated hypertrees
par: Bérénice Oger
Publié: (2013-01-01)

Asymptotic Sharpness of Bounds on Hypertrees
par: Lin Yi, et autres
Publié: (2017-08-01)

Semantic acyclicity under constraints
par: Gottlob, G, et autres
Publié: (2016)