10 citations · 14 across the 6 of their papers we have counts for
6 papers
Dynamics of large scale networks following a merger
John Clements, Babak Farzad, Henryk Fukś
We study the dynamic network of relationships among avatars in the massively multiplayer online game Planetside 2. In the spring of 2014, two separate servers of this game were mer…
A model of language inflection graphs
Henryk Fukś, Babak Farzad, Yi Cao
Inflection graphs are highly complex networks representing relationships between inflectional forms of words in human languages. For so-called synthetic languages, such as Latin or…
Square-Root Finding Problem In Graphs, A Complete Dichotomy Theorem
Babak Farzad, Majid Karimi
Graph G is the square of graph H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Given H it is easy to compute its square H^2. Determinin…
Good edge-labelings and graphs with girth at least five
Michel Bode, Babak Farzad, Dirk Oliver Theis
A good edge-labeling of a graph [Araújo, Cohen, Giroire, Havet, Discrete Appl. Math., forthcoming] is an assignment of numbers to the edges such that for no pair of vertices, there…
Random lifts of are 3-colourable
Babak Farzad, Dirk Oliver Theis
Amit, Linial, and Matou\vsek (Random lifts of graphs III: independence and chromatic number, Random Struct. Algorithms, 2001) have raised the following question: Is the chromatic n…
Computing Graph Roots Without Short Cycles
Babak Farzad, Lap Chi Lau, Van Bang Le +1
Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of distance at most two in H. Given H it is easy to compute its square H2, however M…