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

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

Mostrar outras versões (1)

Detalhes bibliográficos
Principais autores:	Gottlob, G, Pichler, R
Formato:	Journal article
Publicado em:	2004

Registros relacionados

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Combining hypertree‚ bicomp‚ and hinge decomposition
por: Gottlob, G, et al.
Publicado em: (2002)

Covering the Edges of a Random Hypergraph by Cliques
por: Rödl Vojtěch, et al.
Publicado em: (2022-11-01)

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

P 6- and triangle-free graphs revisited: structure and bounded clique-width
por: Andreas Brandstädt, et al.
Publicado em: (2006-01-01)

Semantic width and the fixed-parameter tractability of constraint satisfaction problems
por: Chen, H, et al.
Publicado em: (2020)

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

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

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

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

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

The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
por: Boix-Adserà, Enric, et al.
Publicado em: (2022)

The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
por: Boix-Adsera, Enric, et al.
Publicado em: (2021)

HyperConsistency Width For Constraint Satisfaction
por: Marnette, B, et al.
Publicado em: (2009)

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

Arboricity : an acyclic hypergraph decomposition problem motivated by database theory
por: Chee, Yeow Meng, et al.
Publicado em: (2013)

Fractional covers of hypergraphs with bounded multi-intersection
por: Gottlob, G, et al.
Publicado em: (2023)

Hypergraph Transversals
por: Gottlob, G
Publicado em: (2004)

Sharp Bounds on the Spectral Radii of Uniform Hypergraphs concerning Diameter or Clique Number
por: Qiannan Niu, et al.
Publicado em: (2021-01-01)

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

HyperBench: A benchmark and tool for hypergraphs and empirical findings
por: Fischl, W, et al.
Publicado em: (2019)

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

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

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

Semantic acyclicity under constraints
por: Gottlob, G, et al.
Publicado em: (2016)