Results 41 to 50 of about 58,352 (274)
ISPRS International Journal of Geo-Information, 2016 Spatial data processing often requires massive datasets, and the task/data scheduling efficiency of these applications has an impact on the overall processing performance.
Bo Cheng, Xuefeng Guan, Huayi Wu, Rui Li
doaj +1 more source
Super edge-magic labeling for 𝒌-uniform, complete 𝒌-uniform and complete 𝒌-uniform 𝒌-partite hypergraphs [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2021 Let 𝐻 be a hypergraph with a vertex set 𝑉 and a hyperedge set 𝐸. Generalized from the super edge-magic in a graph, we say that a hypergraph 𝐻 is super edge-magic if there is a bijection 𝑓: 𝑉 ∪ 𝐸 → {1,2,3, … , |𝑉| + |𝐸|} which satisfies: (i) there exists
Ratinan Boonklurb +2 more
doaj +1 more source
Physical Review E, 2023 Providing an abstract representation of natural and human complex structures is a challenging problem. Accounting for the system heterogenous components while allowing for analytical tractability is a difficult balance. Here I introduce complex hypergraphs (chygraphs), bringing together concepts from hypergraphs, multi-layer networks, simplicial ...
openaire +3 more sources
Stock Selection via Spatiotemporal Hypergraph Attention Network: A Learning to Rank Approach
AAAI Conference on Artificial Intelligence, 2021 Quantitative trading and investment decision making are intricate financial tasks that rely on accurate stock selection. Despite advances in deep learning that have made significant progress in the complex and highly stochastic stock prediction problem ...
Ramit Sawhney +4 more
semanticscholar +1 more source
Even order uniform hypergraph via the Einstein product
AKCE International Journal of Graphs and Combinatorics, 2023 We propose the algebraic connectivity of an undirected 2m-uniform hypergraph under the Einstein product. We generalize the algebraic connectivity to a directed 2m-uniform hypergraph and reveal the relationship between the vertex connectivity and the ...
Jiaqi Gu, Yimin Wei
doaj +1 more source
Random Structures & Algorithms, 2012 AbstractThis paper is motivated by the question of how global and dense restriction sets in results from extremal combinatorics can be replaced by less global and sparser ones. The result we consider here as an example is Turán's theorem, which deals with graphs G = ([n],E) such that no member of the restriction set \documentclass{article} \usepackage ...
Allen, Peter +3 more
openaire +3 more sources
A Survey on Hypergraph Neural Networks: An In-Depth and Step-By-Step Guide [PDF]
Knowledge Discovery and Data MiningHigher-order interactions (HOIs) are ubiquitous in real-world complex systems and applications. Investigation of deep learning for HOIs, thus, has become a valuable agenda for the data mining and machine learning communities.
Sunwoo Kim +5 more
semanticscholar +1 more source
Characterizing the hypergraph-of-entity and the structural impact of its extensions
Applied Network Science, 2020 The hypergraph-of-entity is a joint representation model for terms, entities and their relations, used as an indexing approach in entity-oriented search.
José Devezas, Sérgio Nunes
doaj +1 more source
Decomposing hypergraphs into k-colorable hypergraphs
Transactions on Combinatorics, 2014 For a given hypergraph $H$ with chromatic number $chi(H)$ and with no edge containing only one vertex, it is shown that the minimum number $l$ for which there exists a partition (also a covering) ${E_1,E_2,ldots,E_l}$ for $E(H)$, such that the hypergraph induced by $E_i$ for each $1leq ileq l$ is $k$-colorable, is $lceil log_{k} chi(H) rceil$.
Omidi, Gholamreza, Tajbakhsh, Khosro
openaire +2 more sources
Tiling multipartite hypergraphs in quasi-random hypergraphs
Journal of Combinatorial Theory, Series B, 2023 22 pages.
Ding, Laihao +4 more
openaire +3 more sources