3 citations · 3 across the 2 of their papers we have counts for
3 papers
Tight Bounds for Anonymous Parity Certification
Pedro Montealegre, Jorge Valenzuela
Local certification is the task of verifying graph properties using certificates assigned to vertices and checked using only local information. A central question is which properti…
The local complexity of certifying parity
Nicolas Bousquet, Laurent Feuilloley, Jorge Valenzuela +1
In this paper, we consider the problem of locally certifying that the size of a network is even, or more generally, congruent to some fixed number. The parity property is one of th…
On the Strong Roman Domination Number of Graphs
M. P. Alvarez-Ruiz, I. Gonzalez Yero, T. Mediavilla-Gradolph +2
Based on the history that the Emperor Constantine decreed that any undefended place (with no legions) of the Roman Empire must be protected by a "stronger" neighbor place (having t…