Results 41 to 50 of about 47,538 (182)
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
, 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
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
International Joint Conference on Artificial Intelligence, 2023 Identifying the potential associations among drugs, microbes and diseases is of great significance in exploring the pathogenesis and improving precision medicine.
Luotao Liu +6 more
semanticscholar +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
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
Entropic measure and hypergraph states
, 2013 We investigate some properties of the entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing local entropic measure on qubit t of a hypergraph state by using the Hamming weight of the so ...
Bao, Yan-ru +4 more
core +1 more source
Hypergraph Modelling for Geometric Model Fitting
, 2016 In this paper, we propose a novel hypergraph based method (called HF) to fit and segment multi-structural data. The proposed HF formulates the geometric model fitting problem as a hypergraph partition problem based on a novel hypergraph model.
Lai, Taotao +3 more
core +1 more source
On distributed scheduling in wireless networks exploiting broadcast and network coding [PDF]
, 2010 In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links. The wireless broadcast advantage is most useful in multicast scenarios.
Chen, Lijun, Cui, Tao, Ho, Tracey
core +1 more source