Layout of random circulant graphs

Abstract

A circulant graph H is defined on the set of vertices V = {1, . . . , n}A random circulant graph results from deleting edges of H with probability 1 − p. We provide a polynomial time algorithm that approximates the solution to the minimum linear arrangement problem for random circulant graphs. We then bound the error of the approximation with high probability.2000 Mathematics Subject Classification. 05C50; 05C85; 15A52; 15A18.