Fractional covers of hypergraphs with bounded multi-intersection

Fractional covers of hypergraphs with bounded multi-intersection

Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued (hyper-)graph invariants are considered. The focus of this paper is on fractional edge covers of hypergraphs. Our main technical result generalizes and unifies pre...

Полное описание

Библиографические подробности
Главные авторы:	Gottlob, G, Lanzinger, MP, Pichler, R, Razgon, I
Формат:	Journal article
Язык:	English
Опубликовано:	Elsevier 2023

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

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

A note on intersecting hypergraphs with large cover number
по: Haxell, P, и др.
Опубликовано: (2017)

Intersections of hypergraphs
по: Bollobas, B, и др.
Опубликовано: (2014)

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

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

Achieving new upper bounds for the hypergraph duality problem through logic
по: Gottlob, G, и др.
Опубликовано: (2018)

Achieving new upper bounds for the hypergraph duality problem through logic
по: Gottlob, G, и др.
Опубликовано: (2014)

Edge intersection hypergraphs
по: Martin Sonntag, и др.
Опубликовано: (2024-01-01)

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

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

Intersections of random hypergraphs and tournaments
по: Bollobas, B, и др.
Опубликовано: (2014)

Bounds for the Energy of Hypergraphs
по: Liya Jess Kurian, и др.
Опубликовано: (2024-11-01)

Hypergraphs of bounded disjointness
по: Scott, A, и др.
Опубликовано: (2014)

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

Simplicial homeomorphs and trace-bounded hypergraphs
по: Jason Long, и др.
Опубликовано: (2022-07-01)

Identifying the Minimal Transversals of a Hypergraph and Related Problems
по: Eiter, T, и др.
Опубликовано: (1995)

Hypergraph Transversal Computation and Related Problems in Logic and AI
по: Eiter, T, и др.
Опубликовано: (2002)

Improved bounds for the graham-pollak problem for hypergraphs
по: Leader, Imre, и др.
Опубликовано: (2018)

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

New Results on Monotone Dualization and Generating Hypergraph Transversals
по: Eiter, T, и др.
Опубликовано: (2002)

New results on monotone dualization and generating hypergraph transversals
по: Eiter, T, и др.
Опубликовано: (2002)

New Results on Monotone Dualization and Generating Hypergraph Transversals
по: Eiter, T, и др.
Опубликовано: (2003)

Tractable database design through bounded treewidth
по: Gottlob, G, и др.
Опубликовано: (2006)

Efficient Datalog Abduction through Bounded Treewidth
по: Gottlob, G, и др.
Опубликовано: (2007)

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

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

Monadic datalog over finite structures of bounded treewidth.
по: Gottlob, G, и др.
Опубликовано: (2010)

Monadic datalog over finite structures with bounded treewidth
по: Gottlob, G, и др.
Опубликовано: (2007)

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

Bounded treewidth as a key to tractability of knowledge representation and reasoning
по: Gottlob, G, и др.
Опубликовано: (2010)

Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning
по: Gottlob, G, и др.
Опубликовано: (2006)

Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
по: Alexandre Bazin, и др.
Опубликовано: (2023-04-01)

Hypergraph convolution and hypergraph attention
по: Bai, S, и др.
Опубликовано: (2020)

Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
по: Cheung, Wang Chi, и др.
Опубликовано: (2015)

Decomposing hypergraphs into k-colorable hypergraphs
по: Gholamreza Omidi, и др.
Опубликовано: (2014-06-01)

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

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

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

An analytic approach to sparse hypergraphs: hypergraph removal
по: Henry Towsner
Опубликовано: (2018-01-01)

Characterization and recognition of edge intersection graphs of trichromatic hypergraphs with finite multiplicity in the class of split graphs
по: T. V. Lubasheva
Опубликовано: (2018-12-01)