Conference paper
Modeling UpLink power control with outage probabilities
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
The square of an undirected graph G is the graph G2 on the same vertex set such that there is an edge between two vertices in G2 if and only if they are at distance at most 2 in G. The kth power of a graph is defined analogously. It has been conjectured that the problem of computing any square root of a square graph, or even that of deciding whether a graph is a square, is NP-hard. We settle this conjecture in the affirmative. © 1994.
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
Charles A Micchelli
Journal of Approximation Theory
L Auslander, E Feig, et al.
Advances in Applied Mathematics