Results 1 to 10 of about 1,017,247 (314)
(p,q)-biclique counting and enumeration for large sparse bipartite graphs. [PDF]
VLDB J, 2023 In this paper, we study the problem of ( $$p$$ p , $$q$$ q )-biclique counting and enumeration for large sparse bipartite graphs. Given a bipartite graph $$G=(U,V,E)$$ G = ( U , V , E ) and two integer parameters p and q , we aim to efficiently count and
Yang J +5 more
europepmc +2 more sources
Equimatchable Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2023 A graph is called equimatchable if all of its maximal matchings have the same size. Lesk et al. [Equi-matchable graphs, Graph Theory and Combinatorics (Academic Press, London, 1984) 239–254] has provided a characterization of equimatchable bipartite ...
Büyükçolak Yasemin +2 more
doaj +2 more sources
Bipartite graphs in systems biology and medicine: a survey of methods and applications. [PDF]
Gigascience, 2018 The latest advances in high-throughput techniques during the past decade allowed the systems biology field to expand significantly. Today, the focus of biologists has shifted from the study of individual biological components to the study of complex ...
Pavlopoulos GA +5 more
europepmc +2 more sources
Characterization of peptide-protein relationships in protein ambiguity groups via bipartite graphs. [PDF]
PLoS ONE, 2022 In bottom-up proteomics, proteins are enzymatically digested into peptides before measurement with mass spectrometry. The relationship between proteins and their corresponding peptides can be represented by bipartite graphs.
Karin Schork +4 more
doaj +2 more sources
The Bipartite-Splittance of a Bipartite Graph
Discussiones Mathematicae Graph Theory, 2019 A bipartite-split graph is a bipartite graph whose vertex set can be partitioned into a complete bipartite set and an independent set. The bipartite- splittance of an arbitrary bipartite graph is the minimum number of edges to be added or removed in ...
Yin Jian-Hua, Guan Jing-Xin
doaj +2 more sources
Spectral extrema of graphs with fixed size: Cycles and complete bipartite graphs [PDF]
European journal of combinatorics (Print), 2021 Nikiforov (2002) showed that if G is K r + 1 -free then the spectral radius ρ ( G ) ≤ 2 m ( 1 − 1 ∕ r ) , which implies that G contains C 3 if ρ ( G ) > m .
M. Zhai, Huiqiu Lin, Jinlong Shu
semanticscholar +1 more source
The Maximum Spectral Radius of Non-Bipartite Graphs Forbidding Short Odd Cycles [PDF]
Electronic Journal of Combinatorics, 2022 It is well-known that eigenvalues of graphs can be used to describe structural properties and parameters of graphs. A theorem of Nosal and Nikiforov states that if $G$ is a triangle-free graph with $m$ edges, then $\lambda (G)\le \sqrt{m}$, equality ...
Yongtao Li, Yuejian Peng
semanticscholar +1 more source
COIN: Co-Cluster Infomax for Bipartite Graphs [PDF]
arXiv.org, 2022 Bipartite graphs are powerful data structures to model interactions between two types of nodes, which have been used in a variety of applications, such as recommender systems, information retrieval, and drug discovery.
Baoyu Jing +3 more
semanticscholar +1 more source
Domination in some subclasses of bipartite graphs
Discrete Applied Mathematics, 2019 Arti Pandey, B S Panda
exaly +2 more sources
Approximately counting independent sets in bipartite graphs via graph containers [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2021 By implementing algorithmic versions of Sapozhenko's graph container methods, we give new algorithms for approximating the number of independent sets in bipartite graphs.
Matthew Jenssen +2 more
semanticscholar +1 more source