Results 81 to 90 of about 56,011 (266)
On the Chromatic Thresholds of Hypergraphs
, 2013 Let F be a family of r-uniform hypergraphs. The chromatic threshold of F is the infimum of all non-negative reals c such that the subfamily of F comprising hypergraphs H with minimum degree at least $c \binom{|V(H)|}{r-1}$ has bounded chromatic number ...
DHRUV MUBAYI +6 more
core +1 more source
Chain and threshold hypergraphs
AKCE International Journal of Graphs and CombinatoricsThreshold graphs and chain graphs are the graphs with maximum spectral radius among the family of all connected graphs and connected bipartite graphs, respectively.
Shashwath S. Shetty, Arathi Bhat K
doaj +1 more source
Niche Hypergraphs of Products of Digraphs
Discussiones Mathematicae Graph Theory, 2020 If D = (V, A) is a digraph, its niche hypergraph Nℋ(D) = (V, ℰ) has the edge set ℰ={e⊆V||e|≥2∧∃ υ∈V:e=ND−(υ)∨e=ND+(υ)}{\cal E} = \{ {e \subseteq V| | e | \ge 2 \wedge \exists \, \upsilon \in V:e = N_D^ - ( \upsilon ) \vee e = N_D^ + ( \upsilon ...
Sonntag Martin, Teichert Hanns-Martin
doaj +1 more source
Combinatorics, Probability and ComputingAbstract For $\ell \geq 3$ , an $\ell$
Lior Gishboliner, Ethan Honest
openaire +2 more sources
Lightweight Hybrid Wafer Defect Pattern Network Based on Feedforward Efficient Attention
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT With the increase of semiconductor integration density, in order to cope with the increase of wafer defect complexity and types, especially the low recognition accuracy of overlapping mixed defects and unknown wafer defects, this study proposes a lightweight model for wafer defect detection called LightWMNet.
Zhiqiang Hu, Yiquan Wu
wiley +1 more source
Social Influence Maximization in Hypergraphs
Entropy, 2021 This work deals with a generalization of the minimum Target Set Selection (TSS) problem, a key algorithmic question in information diffusion research due to its potential commercial value.
Alessia Antelmi +3 more
semanticscholar +1 more source
Discrete Mathematics, 2012 The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most of the properties, which are known to be true for coloring complexes of graphs, break down in this more general ...
Breuer, Felix +2 more
openaire +4 more sources
A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie +5 more
wiley +1 more source
Saliency Detection Method Using Hypergraphs on Adaptive Multiscales
IEEE Access, 2018 Saliency detection plays an important role in the fields of image processing and computer vision. We present an improved saliency detection method by means of hypergraphs on adaptive multi-scales (HAM).
Feilin Han, Aili Han, Jing Hao
doaj +1 more source
Hypergraph partitioning using tensor eigenvalue decomposition.
PLoS ONE, 2023 Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturing super-dyadic interactions among entities.
Deepak Maurya, Balaraman Ravindran
doaj +1 more source