In: European Journal of Operational Research, 2015, vol. 240, no. 2, p. 307-314
In this paper we present the Selective Graph Coloring Problem, a generalization of the standard graph col-oring problem as well as several of its possible applications. Given a graph with a partition of its vertex set into several clusters, we want to select one vertex per cluster such that the chromatic number of the subgraph induced by the selected vertices is minimum. This problem appeared...
|
In: The Computer Journal, 2015, vol. 58, no. 7, p. 1673-1686
|
In: Physical Review E, 2009, vol. 80, no. 4, p. 046122
Predictions of missing links of incomplete networks, such as protein-protein interaction networks or very likely but not yet existent links in evolutionary networks like friendship networks in web society, can be considered as a guideline for further experiments or valuable information for web users. In this paper, we present a local path index to estimate the likelihood of the existence of a...
|
