30   Artículos

 
en línea
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
Revista: Future Internet    Formato: Electrónico

 
en línea
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
Revista: Algorithms    Formato: Electrónico

 
en línea
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
Revista: Algorithms    Formato: Electrónico

 
en línea
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
Revista: Future Internet    Formato: Electrónico

 
en línea
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
Revista: Algorithms    Formato: Electrónico

 
en línea
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
Revista: International Journal of Open Information Technologies    Formato: Electrónico

 
en línea
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
Revista: Future Internet    Formato: Electrónico

 
en línea
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
Revista: Computers    Formato: Electrónico

 
en línea
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
Revista: Algorithms    Formato: Electrónico

 
en línea
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
Revista: Algorithms    Formato: Electrónico

« Anterior     Página: 1 de 2     Siguiente »