|
|
|
|
|
Robert Albert Klopotek
This paper describes the modeling of social networks subject to a recommendation. The Cold Start User-Item Model (CSUIM) of a bipartite graph is considered, which simulates bipartite graph growth based on several parameters. An algorithm is proposed to c...
ver más
|
|
|
|
|
|
|
|
|
|
|
Martin Kenyeres and Jozef Kenyeres
Consensus-based data aggregation in d-regular bipartite graphs poses a challenging task for the scientific community since some of these algorithms diverge in this critical graph topology. Nevertheless, one can see a lack of scientific studies dealing wi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ahmed El-Mesady, Tasneem Farahat, Ramadan El-Shanawany and Aleksandr Y. Romanov
Nowadays, graph theory is one of the most exciting fields of mathematics due to the tremendous developments in modern technology, where it is used in many important applications. The orthogonal double cover (ODC)" role="presentation">(??????)(ODC)
(
O
D
...
ver más
|
|
|
|
|
|
|
|
|
|
|
Asahi Takaoka
The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles ??0
C
0
and ????
C
t
of a graph G, whether there is a sequence of Hamiltonian cycles ??0,??1,?,????
C
0
,
C
1
,
?
,
C
t
such that ????
C
i
can be obtained from ????-1
C
...
ver más
|
|
|
|
|
|
|
|
|
|
|
Fedor Krasnov
Pág. 31 - 37
The current practice of design and implementation of co-authorship graphs implies the use of mathematical apparatus of graph theory. Traditionally, to build co-authorship graphs using undirected graphs. The authors of this study analysed an approach of b...
ver más
|
|
|
|
|
|
|
|
|
|
|
Qinghai Li and Chang Wu Yu
For many parallel and distributed systems, automatic data redistribution improves its locality and increases system performance for various computer problems and applications. In general, an array can be distributed to multiple processing systems by usin...
ver más
|
|
|
|
|
|
|
|
|
|
|
Anas Abu Taleb, Qasem Abu Al-Haija and Ammar Odeh
Wireless sensor networks (W.S.N.s) are a critical research area with numerous practical applications. W.S.N.s are utilized in real-life scenarios, including environmental monitoring, healthcare, industrial automation, smart homes, and agriculture. As W.S...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ahmed El-Mesady, Aleksandr Y. Romanov, Aleksandr A. Amerikanov and Alexander D. Ivannikov
Recent developments in commutative algebra, linear algebra, and graph theory allow us to approach various issues in several fields. Circulant graphs now have a wider range of practical uses, including as the foundation for optical networks, discrete cell...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ravi Goyal and Victor De Gruttola
This paper presents a general recursive formula to estimate the number of labeled graphs as well as details to evaluate the formula for the following graph properties: number of edges (graph density), degree sequence, degree distribution, classification ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Charles A. Phillips, Kai Wang, Erich J. Baker, Jason A. Bubier, Elissa J. Chesler and Michael A. Langston
Let k denote an integer greater than 2, let G denote a k-partite graph, and let S denote the set of all maximal k-partite cliques in G. Several open questions concerning the computation of S are resolved. A straightforward and highly-scalable modificatio...
ver más
|
|
|
|
|
|
|
|
|
|
|
Gábor Kovács,Gábor Árpád Németh,Zoltán Pap,Mahadevan Subramaniam
Pág. 57 - 61
This paper proposes a string edit distance based test selection method to generate compact test sets for telecommunications software. Following the results of previous research, a trace in a test set is considered to be redundant if its edit distance fro...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mikhail B. Abrosimov,Peter V. Razumovsky
Pág. 1 - 7
The article describes the results of the search for a minimal vertex and edge extensions of an undirected colored star graphs. This search is a part of the minimal extensions of a colored graphs problem research. A graph G* is called a vertex (edge) k-ex...
ver más
|
|
|
|
|
|
|
|
|
|
|
Renaud Fabre, Otmane Azeroual, Patrice Bellot, Joachim Schöpfel and Daniel Egret
The variety and diversity of published content are currently expanding in all fields of scholarly communication. Yet, scientific knowledge graphs (SKG) provide only poor images of the varied directions of alternative scientific choices, and in particular...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dhananjay Thiruvady, Asef Nazari and Aldeida Aleti
Automated deployment of software components into hardware resources is a highly constrained optimisation problem. Hardware memory limits which components can be deployed into the particular hardware unit. Interacting software components have to be deploy...
ver más
|
|
|
|
|
|
|
|
|
|
|
Andrii Morozov,Tamara Loktikova,Iurii Iefremov,Anatolii Dykyi,Pavlo Zabrodskyy
Pág. 21 - 28
By advancing the idea of finding width in bipartite graphs and basic definitions in matching theory, this paper shows that the task on establishing a maximal matching in an arbitrary graph can be reduced to its bipartite case. It has been proven that eac...
ver más
|
|
|
|
|
|