ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Cubicity and Bandwidth

Chandran, Sunil L and Francis, Mathew C and Sivadasan, Naveen (2013) Cubicity and Bandwidth. In: GRAPHS AND COMBINATORICS, 29 (1). pp. 45-69.

[img] PDF
gra_com_29-1_45_2013.pdf - Published Version
Restricted to Registered users only

Download (340kB) | Request a copy
Official URL: http://dx.doi.org/10.1007/s00373-011-1099-x

Abstract

A unit cube in (or a k-cube in short) is defined as the Cartesian product R (1) x R (2) x ... x R (k) where R (i) (for 1 a parts per thousand currency sign i a parts per thousand currency sign k) is a closed interval of the form a (i) , a (i) + 1] on the real line. A k-cube representation of a graph G is a mapping of the vertices of G to k-cubes such that two vertices in G are adjacent if and only if their corresponding k-cubes have a non-empty intersection. The cubicity of G is the minimum k such that G has a k-cube representation. From a geometric embedding point of view, a k-cube representation of G = (V, E) yields an embedding such that for any two vertices u and v, ||f(u) - f(v)||(a) a parts per thousand currency sign 1 if and only if . We first present a randomized algorithm that constructs the cube representation of any graph on n vertices with maximum degree Delta in O(Delta ln n) dimensions. This algorithm is then derandomized to obtain a polynomial time deterministic algorithm that also produces the cube representation of the input graph in the same number of dimensions. The bandwidth ordering of the graph is studied next and it is shown that our algorithm can be improved to produce a cube representation of the input graph G in O(Delta ln b) dimensions, where b is the bandwidth of G, given a bandwidth ordering of G. Note that b a parts per thousand currency sign n and b is much smaller than n for many well-known graph classes. Another upper bound of b + 1 on the cubicity of any graph with bandwidth b is also shown. Together, these results imply that for any graph G with maximum degree Delta and bandwidth b, the cubicity is O(min{b, Delta ln b}). The upper bound of b + 1 is used to derive upper bounds for the cubicity of circular-arc graphs, cocomparability graphs and AT-free graphs in terms of the maximum degree Delta.

Item Type: Journal Article
Additional Information: Copyright for this article belongs to SPRINGER JAPAN KK,JAPAN
Keywords: Cubicity;Bandwidth;Geometric intersection graphs;Randomized algorithms;Derandomization
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Depositing User: Francis Jayakanth
Date Deposited: 28 Jan 2013 07:42
Last Modified: 28 Jan 2013 07:42
URI: http://eprints.iisc.ac.in/id/eprint/45656

Actions (login required)

View Item View Item