Bipartite Diametrical Graphs of Diameter 4 and Extreme Orders [PDF]
International Journal of Mathematics and Mathematical Sciences, 2008 We provide a process to extend any bipartite diametrical graph of diameter 4 to an 𝑆-graph of the same diameter and partite sets. For a bipartite diametrical graph of diameter 4 and partite sets 𝑈 and 𝑊, where 2𝑚=|𝑈|≤|𝑊|, we prove that 2𝑚 is a sharp ...
Salah Al-Addasi, Hasan Al-Ezeh
doaj +2 more sources
Toward heterogeneous information fusion: bipartite graph convolutional networks for in silico drug repurposing. [PDF]
Bioinformatics, 2020 Motivation Mining drug–disease association and related interactions are essential for developing in silico drug repurposing (DR) methods and understanding underlying biological mechanisms.
Wang Z, Zhou M, Arnold C.
europepmc +2 more sources
Drug-target interaction prediction using semi-bipartite graph model and deep learning. [PDF]
BMC Bioinformatics, 2020 Identifying drug-target interaction is a key element in drug discovery. In silico prediction of drug-target interaction can speed up the process of identifying unknown interactions between drugs and target proteins.
Eslami Manoochehri H, Nourani M.
europepmc +2 more sources
Decomposition of Certain Complete Bipartite Graphs into Prisms
Discussiones Mathematicae Graph Theory, 2017 Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n.
Froncek Dalibor
doaj +2 more sources
A random walk-based method to identify driver genes by integrating the subcellular localization and variation frequency into bipartite graph. [PDF]
BMC Bioinformatics, 2019 Song J, Peng W, Wang F.
europepmc +3 more sources
Bipartite Graph Network with Adaptive Message Passing for Unbiased Scene Graph Generation [PDF]
Computer Vision and Pattern Recognition, 2021 Scene graph generation is an important visual understanding task with a broad range of vision applications. Despite recent tremendous progress, it remains challenging due to the intrinsic long-tailed class distribution and large intra-class variation. To
Rongjie Li +3 more
semanticscholar +1 more source
Tensorized Bipartite Graph Learning for Multi-View Clustering [PDF]
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021 Despite the impressive clustering performance and efficiency in characterizing both the relationship between the data and cluster structure, most existing graph-based multi-view clustering methods still have the following drawbacks.
Wei Xia +5 more
semanticscholar +1 more source
Improved Super-Resolution Ultrasound Microvessel Imaging With Spatiotemporal Nonlocal Means Filtering and Bipartite Graph-Based Microbubble Tracking. [PDF]
IEEE Trans Ultrason Ferroelectr Freq Control, 2018 Song P +6 more
europepmc +2 more sources
A Bipartite Graph Neural Network Approach for Scalable Beamforming Optimization [PDF]
IEEE Transactions on Wireless Communications, 2022 Deep learning (DL) techniques have been intensively studied for the optimization of multi-user multiple-input single-output (MU-MISO) downlink systems owing to the capability of handling nonconvex formulations. However, the fixed computation structure of
Junbeom Kim +3 more
semanticscholar +1 more source
Efficient Multi-View Clustering via Unified and Discrete Bipartite Graph Learning [PDF]
IEEE Transactions on Neural Networks and Learning Systems, 2022 Although previous graph-based multi-view clustering (MVC) algorithms have gained significant progress, most of them are still faced with three limitations. First, they often suffer from high computational complexity, which restricts their applications in
Siwei Fang +5 more
semanticscholar +1 more source