A (0, 1)-matrix has the Consecutive Ones Property (C1P) for the rows if there is a permutation of its columns such that the ones in each row appear consecutively. We say a (0, 1)-matrix is nested if it has the consecutive ...

We prove that asymptotically (as n -> infinity) almost all graphs with n vertices and C(d)n(2-1/2d) log(1/d) n edges are universal with respect to the family of all graphs with maximum degree bounded by d. Moreover, we ...

Given a clustered graph (G,V), that is, a graph G=(V,E) together with a partition V of its vertex set, the selective coloring problem consists in choosing one vertex per cluster such that the chromatic number of the subgraph ...

Receiving Operating Characteristic (ROC) curves are bidimensional graphs commonly used to evaluate and compare the performance of classifiers. ROC plots nicely show the sensitivity/specificity trade-off of a classifier for ...

We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active vertices are chosen independently with ...

After a sequence of improvements Boyd et al. [TSP on cubic and subcubic graphs, Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 6655, Springer, Heidelberg, 2011, pp. 65-77] proved that any ...

In this paper a lossy image compression methodusing the adjacency matrix of a graph is proposed.We instantiate the method using the Hamming graph,which gives rise to an image compression algorithmthat uses a Hadamard Matrix ...