Anderson N. Martinhão

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The concept of embedded matching in a weighted graph is introduced, and the maximum cardinality of an embedded matching is computed. On the other hand, consider the following problem induced by a short covering. Given a prime power q, the number c(q) denotes the minimum cardinality of a subset H of Fq which satisfies the following property: every element in(More)
  • 1