Results 21 to 30 of about 41,298 (230)
Oriented hypergraphs: Balanceability
Discrete Mathematics, 2022 An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the signed graphic frame matroid to any oriented hypergraphic incidence matrix via its locally-signed-graphic
Lucas J. Rusnak +4 more
openaire +2 more sources
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
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
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
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
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
IEEE Access, 2023 With the increasingly competitive job market, the employment issue for college graduates has received more and more attention. Predicting graduation development can help students understand their suitable graduation development, thus easing the pressure ...
Yong Ouyang +4 more
doaj +1 more source
Topology and its Applications, 2011 We investigate a family of polytopes introduced by E.M.\ Feichtner, A.\ Postnikov and B.\ Sturmfels, which were named nestohedra. The vertices of these polytopes may intuitively be understood as constructions of hypergraphs. Limit cases in this family of polytopes are, on the one end, simplices, and, on the other end, permutohedra.
Došen, Kosta, Petrić, Zoran
openaire +3 more sources