In a graph G = (V , E), the density is the ratio between the number of edges |E| and the number of vertices |V |. This criterion may be used to find communities in a graph: groups of highly connectedâ€¦ (More)

BACKGROUND
Chronic lung consolidation has a limited number of differential diagnoses requiring distinct managements. The aim of the study was to investigate how logical analysis of data (LAD) canâ€¦ (More)

In a graph G = (V, E), the density is the ratio between the number of edges |E| and the number of vertices |V |. This criterion may be used to find communities in a graph: groups of highly connectedâ€¦ (More)

In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are interested in finding the minimum cardinalityâ€¦ (More)