Sciweavers

MFCS
2009
Springer
14 years 1 months ago
Balanced Paths in Colored Graphs
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
Alessandro Bianco, Marco Faella, Fabio Mogavero, A...