1 citations · 1 across the 4 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.CC2018★ 1 cited
On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs
Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut
Numerous problems consisting in identifying vertices in graphs using distances are useful in domains such as network verification and graph isomorphism. Unifying them into a meta-p…
cs.DM2018
Quasiperiods of biinfinite Sturmian words
Florian Barbero, Guilhem Gamard, Anaël Grandjean
We study the notion of quasiperiodicity, in the sense of "coverability", for biinfinite words. All previous work about quasiperiodicity focused on right infinite words, but the pas…