Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other verti...
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-...
The measurable list chromatic number of a graph G is the smallest number such that if each vertex v of G is assigned a set L(v) of measure in a fixed atomless measure space, the...
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...