10 citations · 10 across the 2 of their papers we have counts for
2 papers
cs.DM2012★ 10 cited
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…
cs.DM2009
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…