|
|
|
|
|
Gabriel Valiente
Graph algorithms that test adjacencies are usually implemented with an adjacency-matrix representation because the adjacency test takes constant time with adjacency matrices, but it takes linear time in the degree of the vertices with adjacency lists. In...
ver más
|
|
|
|
|
|
|
|
|
|
|
Giorgio Gronchi, Marco Raglianti and Fabio Giovannelli
As part of studies that employ health electronic records databases, this paper advocates the employment of graph theory for investigating drug-switching behaviors. Unlike the shared approach in this field (comparing groups that have switched with control...
ver más
|
|
|
|
|
|
|
|
|
|
|
A.A. Ripinen,M.B. Abrosimov
Pág. 46 - 50
A graph G is called primitive if all vertices in it are mutually reachable in the same number of steps. The concept of primitivity was originally formulated for matrices and naturally extended to graphs when considering a graph as an adjacency matrix. Re...
ver más
|
|
|
|
|
|
|
|
|
|
|
Armando Di Nardo, Carlo Giudicianni, Roberto Greco, Manuel Herrera and Giovanni F. Santonastaso
Cities depend on multiple heterogeneous, interconnected infrastructures to provide safe water to consumers. Given this complexity, efficient numerical techniques are needed to support optimal control and management of a water distribution network (WDN). ...
ver más
|
|
|
|
|
|