Results 51 to 60 of about 58,352 (274)
A Survey on Hypergraph Mining: Patterns, Tools, and Generators [PDF]
ACM Computing SurveysHypergraphs, which belong to the family of higher-order networks, are a natural and powerful choice for modeling group interactions in the real world.
Geon Lee +3 more
semanticscholar +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
Quasi‐random hypergraphs [PDF]
Random Structures & Algorithms, 1989 AbstractWe introduce an equivalence class of varied properties for hypergraphs. Any hypergraph possessing any one of these properties must of necessity possess them all. Since almost all random hypergraphs share these properties, we term these properties quasi‐random.
Chung, F. R. K., Graham, R. L.
openaire +3 more sources
High-Quality Hypergraph Partitioning [PDF]
ACM Journal of Experimental Algorithmics, 2021 Hypergraphs are a generalization of graphs where edges (aka nets) are allowed to connect more than two vertices. They have a similarly wide range of applications as graphs.
Sebastian Schlag +5 more
semanticscholar +1 more source
Almost Self-Complementary Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2018 A k-uniform hypergraph (k-hypergraph) is almost self-complementary if it is isomorphic with its complement in the complete k-uniform hypergraph minus one edge. We prove that an almost self-complementary k-hypergraph of order n exists if and only if (nk)$\
Wojda Adam Paweł
doaj +1 more source
Algebraic structures and lattice properties of hypergraph Pre-Rough sets [PDF]
Mathematics and Computational SciencesThe study introduces and examines the concept of hypergraph pre-rough sets, which are developed by combining minimum soft descriptions with hypergraph structures.
Ganesan Gomathi +3 more
doaj +1 more source
Generative hypergraph clustering: From blockmodels to modularity [PDF]
Science Advances, 2021 Novel clustering techniques enable the detection of modules in large datasets with multiway interactions. Hypergraphs are a natural modeling paradigm for networked systems with multiway interactions.
Philip S. Chodrow +2 more
semanticscholar +1 more source
Individual Differences in Dynamic Functional Brain Connectivity across the Human Lifespan. [PDF]
PLoS Computational Biology, 2016 Individual differences in brain functional networks may be related to complex personal identifiers, including health, age, and ability. Dynamic network theory has been used to identify properties of dynamic brain function from fMRI data, but the majority
Elizabeth N Davison +6 more
doaj +1 more source
Optimal Query Complexity for Reconstructing Hypergraphs [PDF]
, 2010 In this paper we consider the problem of reconstructing a hidden weighted hypergraph of constant rank using additive queries. We prove the following: Let $G$ be a weighted hidden hypergraph of constant rank with n vertices and $m$ hyperedges. For any $m$
Bshouty, Nader H., Mazzawi, Hanna
core +6 more sources