Some Strong Connectivity Concepts in Weighted Graphs

As a multicomputer structure, the balanced hypercube is a variant of the standard hypercube for multicomputers, with desirable properties of strong connectivity, regularity, and symmetry. This structure is a special type of load balanced graph designed to tolerate processor failure. In balanced hypercubes, each processor has a backup (matching) processor that shares the same set of neighboring nodes. Therefore, tasks that run on a faulty processor can be reactivated in the backup processor to provide efficient system reconfiguration. In this paper, we study the implementation of balanced hypercubes in VLSI using the Wafer Scale Integration (VLSI/WSI) technology. Emphasis is on VLSI/WSI layout and area estimates. Our results show that the balanced hypercube can be implemented at least as efficient as the standard hypercube in an area layout and more efficient in a linear layout.

Download Full-text

Path ideals of weighted graphs

Journal of Pure and Applied Algebra ◽

10.1016/j.jpaa.2014.12.027 ◽

2015 ◽

Vol 219 (9) ◽

pp. 3889-3912 ◽

Cited By ~ 1

Author(s):

Bethany Kubik ◽

Sean Sather-Wagstaff

Keyword(s):

Weighted Graphs

Download Full-text

Lossy Compression of Dynamic, Weighted Graphs

2015 3rd International Conference on Future Internet of Things and Cloud ◽

10.1109/ficloud.2015.64 ◽

2015 ◽

Cited By ~ 4

Author(s):

Wilko Henecka ◽

Matthew Roughan

Keyword(s):

Lossy Compression ◽

Weighted Graphs

Download Full-text

On Identity Disclosure in Weighted Graphs

2010 International Conference on Parallel and Distributed Computing, Applications and Technologies ◽

10.1109/pdcat.2010.23 ◽

2010 ◽

Cited By ~ 2

Author(s):

Yidong Li ◽

Hong Shen

Keyword(s):

Weighted Graphs ◽

Identity Disclosure

Download Full-text

On-line maintenance of simplified weighted graphs for efficient distance queries

Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems - GIS '06 ◽

10.1145/1183471.1183505 ◽

2006 ◽

Author(s):

Floris Geerts ◽

Peter Revesz ◽

Jan Van den Bussche

Keyword(s):

Weighted Graphs ◽

On Line

Download Full-text

Spread of Epidemic Disease on Edge-Weighted Graphs from a Database: A Case Study of COVID-19

International Journal of Environmental Research and Public Health ◽

10.3390/ijerph18094432 ◽

2021 ◽

Vol 18 (9) ◽

pp. 4432

Author(s):

Ronald Manríquez ◽

Camilo Guerrero-Nancuante ◽

Felipe Martínez ◽

Carla Taramasco

Keyword(s):

Public Health ◽

Infectious Diseases ◽

Preventive Measures ◽

Weighted Graph ◽

Real Data ◽

Sir Model ◽

Weighted Graphs ◽

Epidemic Disease ◽

The Real

The understanding of infectious diseases is a priority in the field of public health. This has generated the inclusion of several disciplines and tools that allow for analyzing the dissemination of infectious diseases. The aim of this manuscript is to model the spreading of a disease in a population that is registered in a database. From this database, we obtain an edge-weighted graph. The spreading was modeled with the classic SIR model. The model proposed with edge-weighted graph allows for identifying the most important variables in the dissemination of epidemics. Moreover, a deterministic approximation is provided. With database COVID-19 from a city in Chile, we analyzed our model with relationship variables between people. We obtained a graph with 3866 vertices and 6,841,470 edges. We fitted the curve of the real data and we have done some simulations on the obtained graph. Our model is adjusted to the spread of the disease. The model proposed with edge-weighted graph allows for identifying the most important variables in the dissemination of epidemics, in this case with real data of COVID-19. This valuable information allows us to also include/understand the networks of dissemination of epidemics diseases as well as the implementation of preventive measures of public health. These findings are important in COVID-19’s pandemic context.

Download Full-text