2 papers
cs.DS2026
Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
Florent Foucaud, Narges Ghareghani, Lucas Lorieau +3
In the GEODETIC SET problem, an input is a (di)graph and integer , and the objective is to decide whether there exists a vertex subset of size such that any vertex i…
math.CO2026
Enumeration of Factor Occurrences in -Bonacci Words over an Infinite Alphabet
Narges Ghareghani, Mehdi Golafshan, Morteza Mohammad-Noori +1
We study the -Bonacci word over the infinite alphabet . Since the alphabet is infinite, the usual factor complexity is infinite and does not provide any information.…