Results 51 to 60 of about 92,446 (202)
FLEET: Butterfly Estimation from a Bipartite Graph Stream
, 2019 We consider space-efficient single-pass estimation of the number of butterflies, a fundamental bipartite graph motif, from a massive bipartite graph stream where each edge represents a connection between entities in two different partitions. We present a
Bar-Yossef R. Kumar Z. +10 more
core +1 more source
Phase‐Sensitive Engineering of Optical Disordered Materials Using Heterogeneous Networks
Advanced Optical Materials, EarlyView.Networks provide an insightful framework for describing complex interactions. Here, we develop heterogeneous network modeling of light scattering to engineer multiphase random heterogeneous materials. We devise multipartite network decomposition, separating intra‐ and inter‐phase wave interferences.
Seungmok Youn +5 more
wiley +1 more source
Semantic Web Service Discovery Based on Clustering and Bipartite Graph Matching [PDF]
Jisuanji gongcheng, 2016 In order to efficiently and accurately locate semantic Web service,a new semantic Web service discovery method is proposed based on clustering and bipartite graph matching.In this method,services are clustered according to the service description ...
LIU Yisong,ZHU Dan
doaj +1 more source
Electronic Notes in Discrete Mathematics, 1999 Two graphs \(G\) and \(H\) on the vertex set \(V\) are \(P_4\)-isomorphic if there is a permutation \(\pi\) on \(V\) such that, for all subsets \(S\) of \(V\), \(S\) induces a chordless \(P_4\) in \(G\) if and only if \(\pi (S)\) induces a \(P_4\) in \(H\). The author characterizes all graphs \(P_4\)-isomorphic to a bipartite graph. For example, we can
openaire +1 more source
PAIR: Reconstructing Single‐Cell Open‐Chromatin Landscapes for Transcription Factor Regulome Mapping
Advanced Science, EarlyView.scATAC‐seq analysis is often constrained by limited sequencing depth, extreme sparsity, and pervasive technical missingness. PAIR is a probabilistic framework that restores scATAC‐seq accessibility profiles by directly modeling the native cell–peak bipartite structure of chromatin accessibility.
Yanchi Su +7 more
wiley +1 more source
Ore Image Segmentation by Bipartite Graph Based on Collaborative Representation [PDF]
Jisuanji gongcheng, 2016 Image segmentation algorithm by bipartite graph considers the spatial organization relation between superpixels as well as pixel and superpixels,which is robust for ore image segmentation.This paper proposes a bipartite graph algorithm based on ...
ZHOU Jing,YANG Fan,SHI Lingyi,ZHENG Zhonglong
doaj +1 more source
Bipartite Kneser Graphs are Hamiltonian [PDF]
Combinatorica, 2015 ISSN:1439 ...
Mütze Torsten, Su Pascal
openaire +4 more sources
Graph‐based imitation and reinforcement learning for efficient Benders decomposition
AIChE Journal, EarlyView.Abstract This work introduces an end‐to‐end graph‐based agent for accelerating the computational efficiency of Benders Decomposition. The agent's policy is parameterized by a graph neural network, which takes as input a bipartite graph representation of the master problem and proposes a candidate solution.
Bernard T. Agyeman +3 more
wiley +1 more source
A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs [PDF]
, 2006 We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor.
Friedland, Shmuel, Levy, Daniel
core +1 more source
Restricted Tweedie stochastic block models
Canadian Journal of Statistics, EarlyView.Abstract The stochastic block model (SBM) is a widely used framework for community detection in networks, where the network structure is typically represented by an adjacency matrix. However, conventional SBMs are not directly applicable to an adjacency matrix that consists of nonnegative zero‐inflated continuous edge weights.
Jie Jian, Mu Zhu, Peijun Sang
wiley +1 more source