Results 61 to 70 of about 58,352 (274)
, 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
On edge-sets of bicliques in graphs [PDF]
, 2012 A biclique is a maximal induced complete bipartite subgraph of a graph. We investigate the intersection structure of edge-sets of bicliques in a graph. Specifically, we study the associated edge-biclique hypergraph whose hyperedges are precisely the edge-
Groshaus, Marina +2 more
core +2 more sources
Hypernetwork science via high-order hypergraph walks
EPJ Data Science, 2020 We propose high-order hypergraph walks as a framework to generalize graph-based network science techniques to hypergraphs. Edge incidence in hypergraphs is quantitative, yielding hypergraph walks with both length and width.
Sinan G. Aksoy +4 more
doaj +1 more source
The existence of bipartite almost self-complementary 3-uniform hypergraphs [PDF]
Opuscula Mathematica, 2023 An almost self-complementary 3-uniform hypergraph on \(n\) vertices exists if and only if \(n\) is congruent to 3 modulo 4 A hypergraph \(H\) with vertex set \(V\) and edge set \(E\) is called bipartite if \(V\) can be partitioned into two subsets \(V_1\
L.N. Kamble +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
MSHC: a multi-stage hypergraph clustering algorithm
Shenzhen Daxue xuebao. Ligong banAs a high-dimensional extension of ordinary graphs, hypergraphs can more flexibly reflect high-order complex relationships between nodes. Hypergraph clustering aims to discover complex high-order correlations in powerful hypergraph structures.
ZHANG Chunying +4 more
doaj +1 more source
Metro Passenger Flow Prediction via Dynamic Hypergraph Convolution Networks
IEEE transactions on intelligent transportation systems (Print), 2021 Metro passenger flow prediction is a strategically necessary demand in an intelligent transportation system to alleviate traffic pressure, coordinate operation schedules, and plan future constructions. Graph-based neural networks have been widely used in
Jingcheng Wang +5 more
semanticscholar +1 more source
Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion [PDF]
, 2014 The expansion of a hypergraph, a natural extension of the notion of expansion in graphs, is defined as the minimum over all cuts in the hypergraph of the ratio of the number of the hyperedges cut to the size of the smaller side of the cut.
Louis, Anand, Makarychev, Yury
core +2 more sources
EngineeringPractical real-world scenarios such as the Internet, social networks, and biological networks present the challenges of data scarcity and complex correlations, which limit the applications of artificial intelligence. The graph structure is a typical tool
Yue Gao +3 more
doaj +1 more source