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

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

Показать другие версии (1)

Библиографические подробности
Главные авторы:	Gottlob, G, Pichler, R
Формат:	Journal article
Опубликовано:	2004

Схожие документы

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width
по: Gottlob, G, и др.
Опубликовано: (2001)

Hypertree width and related hypergraph invariants
по: Adler, I, и др.
Опубликовано: (2007)

Hypertree-Width and Related Hypergraph Invariants
по: Isolde Adler, и др.
Опубликовано: (2005-01-01)

Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width
по: Gottlob, G, и др.
Опубликовано: (2003)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
по: Gottlob, G, и др.
Опубликовано: (2001)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
по: Gottlob, G, и др.
Опубликовано: (2001)

General and fractional hypertree decompositions: hard and easy cases
по: Fischl, W, и др.
Опубликовано: (2018)

General and fractional hypertree decompositions: hard and easy cases
по: Fischl, W, и др.
Опубликовано: (2018)

Complexity analysis of generalized and fractional hypertree decompositions
по: Gottlob, G, и др.
Опубликовано: (2021)

Fast parallel hypertree decompositions in logarithmic recursion depth
по: Gottlob, G, и др.
Опубликовано: (2022)

Hypertree Decompositions and Tractable Queries
по: Gottlob, G, и др.
Опубликовано: (1998)

Hypertree Decompositions: A Survey
по: Gottlob, G, и др.
Опубликовано: (2001)

Hypertree Decompositions and Tractable Queries
по: Gottlob, G, и др.
Опубликовано: (2002)

Hypertree Decompositions and Tractable Queries
по: Gottlob, G, и др.
Опубликовано: (1999)

Hypertree Decompositions and Tractable Queries
по: Gottlob, G, и др.
Опубликовано: (1999)

Hypertree decompositions: questions and answers
по: Gottlob, G, и др.
Опубликовано: (2016)

Combining hypertree‚ bicomp‚ and hinge decomposition
по: Gottlob, G, и др.
Опубликовано: (2002)

Covering the Edges of a Random Hypergraph by Cliques
по: Rödl Vojtěch, и др.
Опубликовано: (2022-11-01)

Incremental updates of generalized hypertree decompositions
по: Gottlob, G, и др.
Опубликовано: (2022)

P 6- and triangle-free graphs revisited: structure and bounded clique-width
по: Andreas Brandstädt, и др.
Опубликовано: (2006-01-01)

Semantic width and the fixed-parameter tractability of constraint satisfaction problems
по: Chen, H, и др.
Опубликовано: (2020)

Hypertree Decompositions: Structure‚ Algorithms‚ and Applications
по: Gottlob, G, и др.
Опубликовано: (2005)

A Backtracking−Based Algorithm for Computing Hypertree−Decompositions
по: Gottlob, G, и др.
Опубликовано: (2007)

Generalized hypertree decompositions: np−hardness and tractable variants
по: Gottlob, G, и др.
Опубликовано: (2007)

Generalized hypertree decompositions: np-hardness and tractable variants.
по: Gottlob, G, и др.
Опубликовано: (2007)

On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
по: Gottlob, G, и др.
Опубликовано: (2007)

The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
по: Boix-Adserà, Enric, и др.
Опубликовано: (2022)

The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
по: Boix-Adsera, Enric, и др.
Опубликовано: (2021)

HyperConsistency Width For Constraint Satisfaction
по: Marnette, B, и др.
Опубликовано: (2009)

Inapproximability of Rank, Clique, Boolean, and Maximum Induced Matching-Widths under Small Set Expansion Hypothesis
по: Koichi Yamazaki
Опубликовано: (2018-10-01)

Arboricity : an acyclic hypergraph decomposition problem motivated by database theory
по: Chee, Yeow Meng, и др.
Опубликовано: (2013)

Fractional covers of hypergraphs with bounded multi-intersection
по: Gottlob, G, и др.
Опубликовано: (2023)

Hypergraph Transversals
по: Gottlob, G
Опубликовано: (2004)

Sharp Bounds on the Spectral Radii of Uniform Hypergraphs concerning Diameter or Clique Number
по: Qiannan Niu, и др.
Опубликовано: (2021-01-01)

On cordial labeling of hypertrees
по: Michał Tuczyński, и др.
Опубликовано: (2019-08-01)

HyperBench: A benchmark and tool for hypergraphs and empirical findings
по: Fischl, W, и др.
Опубликовано: (2019)

On binary decision hypertree (hyperdiagram)
по: Mohammad Hamidi, и др.
Опубликовано: (2024-04-01)

PreLie-decorated hypertrees
по: Bérénice Oger
Опубликовано: (2013-01-01)

Asymptotic Sharpness of Bounds on Hypertrees
по: Lin Yi, и др.
Опубликовано: (2017-08-01)

Semantic acyclicity under constraints
по: Gottlob, G, и др.
Опубликовано: (2016)