10 citations · 20 across the 23 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.CO2012★ 10 cited
A simple and fast heuristic algorithm for edge-coloring of graphs
M. A. Fiol, J. Vilaltella
A simple but empirically efficient heuristic algorithm for the edge-coloring of graphs is presented. Its basic idea is the displacement of "conflicts" (repeated colors in the edges…
math.CO2012★ 3 cited
A note on the voting problem
M. A. Fiol
Let be the minimum number of voters with transitive preferences which are needed to generate any strong preference pattern (ties not allowed) on candidates. Let $k=\lflo…