Results 71 to 80 of about 617,805 (269)
A note on pm-compact bipartite graphs
Discussiones Mathematicae Graph Theory, 2014 A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2
Liu Jinfeng, Wang Xiumei
doaj +1 more source
BinSlayer: Accurate Comparison of Binary Executables [PDF]
, 2013 As the volume of malware inexorably rises, comparison of binary code is of increasing importance to security analysts as a method of automatically classifying new malware samples; purportedly new examples of malware are frequently a simple evolution of ...
Martial Bourquin +5 more
core +1 more source
BIPARTITE STEINHAUS GRAPHS [PDF]
Taiwanese Journal of Mathematics, 1999 A Steinhaus matrix is a symmetric 0-1 matrix \([a_{i,j}]_{n\times n}\) such that \(a_{i,j}= 0\) for \(0\leq i\leq n-1\) and \(a_{i,j}\equiv (a_{i- 1,j-1}+ a_{i-1,j})\pmod 2\) for \(1\leq i\leq n-1\). A Steinhaus graph is a graph whose adjacency matrix is a Steinhaus matrix. In this paper Lee and Chang prove that if \(G\) is a Steinhaus graph of order \(
Lee, Yueh-Shin, Chang, G. J.
openaire +3 more sources
International Journal of Applied Mathematics and Computer ScienceThis paper introduces the concept of filters in a rough bi-Heyting algebra. The rough bi-Heyting algebra defined through the rough semiring offers interesting properties.
Praba Bashyam +1 more
doaj +1 more source
Bipartite graph capsule network [PDF]
Graphs have been widely adopted in various fields, where many graph models are developed. Most of previous research focuses on unipartite or homogeneous graph analysis.
Wang, H +5 more
core +1 more source
Multi-View Clustering via Projection-Enhanced Bipartite Graph Learning and Consensus Fusion
MathematicsAnchor-based bipartite graph methods provide scalable solutions for multi-view clustering, but most of them construct graphs in the original feature space, where high dimensionality distorts the proximity between samples and anchors and degrades graph ...
Xun Liu, Qing-Wen Wang, Jiang-Feng Chen
doaj +1 more source
Decomposition of Complete Bipartite Graphs into Cycles of Distinct Even Lengths
, 2016 Let Kn,n be the complete bipartite graph with two parts of equal size n. In this paper, it is shown that depending on whether n is even or odd, Kn,n or Kn,n−I , where I is a 1-factor of Kn,n , can be decomposed into cycles of distinct even lengths ...
Fu, Chin-Mei;Huang, Kuo-Ching;Mishima, Miwako
core +1 more source
Parameterized streaming : maximal matching and vertex cover [PDF]
, 2014 As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one.
Chitnis, Rajesh; id_orcid +11 more
core +1 more source
Journal of Robotics, 2020 The paper discusses the solution of the assignment task between two groups of mobile (MR) objects. The assignment task is to determine the purpose of MR to each other when playing football.
Denis Aleksandrovich Beloglazov +3 more
doaj +1 more source
On bipartite graphs with complete bipartite star complements
, 2014 Let G be a bipartite graph with μ as an eigenvalue of multiplicity k>1k>1. We show that if G has Kr,sKr,s(1≤r≤s)(1≤r≤s) as a star complement for μ then k≤s-1k≤s-1; moreover if μ is non-main then k≤s-2k≤s-2 for large enough s .
Rowlinson, Peter
core +1 more source