Results 71 to 80 of about 56,162 (272)
Analyzing Dynamic Hypergraphs with Parallel Aggregated Ordered Hypergraph Visualization
IEEE Transactions on Visualization and Computer Graphics, 2021 Parallel Aggregated Ordered Hypergraph(PAOH) is a novel technique to visualize dynamic hypergraphs. Hypergraphs are a generalization of graphs where edges can connect several vertices.
Paola Valdivia +4 more
semanticscholar +1 more source
A Note on Packing of Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2022 We say that two n-vertex hypergraphs H1 and H2 pack if they can be found as edge-disjoint subhypergraphs of the complete hypergraph Kn. Whilst the problem of packing of graphs (i.e., 2-uniform hypergraphs) has been studied extensively since seventies ...
Konarski Jerzy +2 more
doaj +1 more source
Independence densities of hypergraphs [PDF]
, 2013 We consider the number of independent sets in hypergraphs, which allows us to define the independence density of countable hypergraphs. Hypergraph independence densities include a broad family of densities over graphs and relational structures, such as ...
Bonato, Anthony +3 more
core +3 more sources
, 2011 Hypergraphs are generalization of graphs where each edge (hyperedge) can connect more than two vertices. In simple terms, the hypergraph partitioning problem can be defined as the task of dividing the vertices of hypergraph into two or more roughly equal sized parts such that a cost function on the hyperedges connecting vertices in different parts is ...
Quincey Koziol +13 more
openaire +3 more sources
Granulation of Hypernetwork Models under the q-Rung Picture Fuzzy Environment
Mathematics, 2019 In this paper, we define q-rung picture fuzzy hypergraphs and illustrate the formation of granular structures using q-rung picture fuzzy hypergraphs and level hypergraphs.
Anam Luqman +2 more
doaj +1 more source
Journal of Pure and Applied Algebra, 2019 38 ...
Fong, Brendan, Spivak, David I.
openaire +4 more sources
Hypergraph coverings and Ramanujan Hypergraphs
, 2023 In this paper we investigate Ramanujan hypergraphs by using hypergraph coverings. We first show that the spectrum of a $k$-fold covering $\bar{H}$ of a connected hypergraph $H$ contains the spectrum of $H$, and that it is the union of the spectrum of $H$ and the spectrum of an incidence-signed hypergraph with $H$ as underlying hypergraph if $k=2 ...
Song, Yi-Min +2 more
openaire +2 more sources
Complex Neutrosophic Hypergraphs: New Social Network Models
Algorithms, 2019 A complex neutrosophic set is a useful model to handle indeterminate situations with a periodic nature. This is characterized by truth, indeterminacy, and falsity degrees which are the combination of real-valued amplitude terms and complex-valued phase ...
Anam Luqman +2 more
doaj +1 more source
Annotated hypergraphs: models and applications
Applied Network Science, 2020 Hypergraphs offer a natural modeling language for studying polyadic interactions between sets of entities. Many polyadic interactions are asymmetric, with nodes playing distinctive roles.
Philip Chodrow, Andrew Mellor
doaj +1 more source
Toric algebra of hypergraphs [PDF]
, 2013 The edges of any hypergraph parametrize a monomial algebra called the edge subring of the hypergraph. We study presentation ideals of these edge subrings, and describe their generators in terms of balanced walks on hypergraphs.
Petrović, Sonja, Stasi, Despina
core +1 more source