11 citations · 16 across the 3 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014
Identifying codes in vertex-transitive graphs and strongly regular graphs
Sylvain Gravier, Aline Parreau, Sara Rottey +2
We consider the problem of computing identifying codes of graphs and its fractional relaxation. The ratio between the size of optimal integer and fractional solutions is between 1…
cs.FL2014
A new approach to the -regularity of the -abelian complexity of -automatic sequences
Aline Parreau, Michel Rigo, Eric Rowland +1
We prove that a sequence satisfying a certain symmetry property is -regular in the sense of Allouche and Shallit, i.e., the -module generated by its -kernel is fi…