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

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

Taispeáin leaganacha eile (1)

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Gottlob, G, Pichler, R
Formáid:	Journal article
Foilsithe / Cruthaithe:	2004

Míreanna comhchosúla

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

Hypertree width and related hypergraph invariants
de réir: Adler, I, et al.
Foilsithe / Cruthaithe: (2007)

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

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)

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)

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

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

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)

Covering the Edges of a Random Hypergraph by Cliques
de réir: Rödl Vojtěch, et al.
Foilsithe / Cruthaithe: (2022-11-01)

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

P 6- and triangle-free graphs revisited: structure and bounded clique-width
de réir: Andreas Brandstädt, et al.
Foilsithe / Cruthaithe: (2006-01-01)

Semantic width and the fixed-parameter tractability of constraint satisfaction problems
de réir: Chen, H, et al.
Foilsithe / Cruthaithe: (2020)

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

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)

The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
de réir: Boix-Adserà, Enric, et al.
Foilsithe / Cruthaithe: (2022)

The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
de réir: Boix-Adsera, Enric, et al.
Foilsithe / Cruthaithe: (2021)

HyperConsistency Width For Constraint Satisfaction
de réir: Marnette, B, et al.
Foilsithe / Cruthaithe: (2009)

Inapproximability of Rank, Clique, Boolean, and Maximum Induced Matching-Widths under Small Set Expansion Hypothesis
de réir: Koichi Yamazaki
Foilsithe / Cruthaithe: (2018-10-01)

Arboricity : an acyclic hypergraph decomposition problem motivated by database theory
de réir: Chee, Yeow Meng, et al.
Foilsithe / Cruthaithe: (2013)

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

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

Sharp Bounds on the Spectral Radii of Uniform Hypergraphs concerning Diameter or Clique Number
de réir: Qiannan Niu, et al.
Foilsithe / Cruthaithe: (2021-01-01)

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

HyperBench: A benchmark and tool for hypergraphs and empirical findings
de réir: Fischl, W, et al.
Foilsithe / Cruthaithe: (2019)

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)

Semantic acyclicity under constraints
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2016)