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

On the Cubicity of AT-Free Graphs and Circular-Arc Graphs

Chandran, L Sunil and Francis, Mathew C and Sivadasan, Naveen (2009) On the Cubicity of AT-Free Graphs and Circular-Arc Graphs. In: conference on Graph Theory, Computational Intelligence and Thought, SEP 19, 2008-SEP 25, 2009, Jerusalem.

[img] PDF
fulltext.pdfj.pdf - Published Version
Restricted to Registered users only

Download (206Kb) | Request a copy
Official URL: http://www.springerlink.com/content/gq1x7gr1rx3v8u...

Abstract

A unit cube in k dimensions (k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), a(i) + 1] on the real line. A graph G on n nodes is said to be representable as the intersection of k-cubes (cube representation in k dimensions) if each vertex of C can be mapped to a k-cube such that two vertices are adjacent in G if and only if their corresponding k-cubes have a non-empty intersection. The cubicity of G denoted as cub(G) is the minimum k for which G can be represented as the intersection of k-cubes. An interesting aspect about cubicity is that many problems known to be NP-complete for general graphs have polynomial time deterministic algorithms or have good approximation ratios in graphs of low cubicity. In most of these algorithms, computing a low dimensional cube representation of the given graph is usually the first step. We give an O(bw . n) algorithm to compute the cube representation of a general graph G in bw + 1 dimensions given a bandwidth ordering of the vertices of G, where bw is the bandwidth of G. As a consequence, we get O(Delta) upper bounds on the cubicity of many well-known graph classes such as AT-free graphs, circular-arc graphs and cocomparability graphs which have O(Delta) bandwidth. Thus we have: 1. cub(G) <= 3 Delta - 1, if G is an AT-free graph. 2. cub(G) <= 2 Delta + 1, if G is a circular-arc graph. 3. cub(G) <= 2 Delta, if G is a cocomparability graph. Also for these graph classes, there axe constant factor approximation algorithms for bandwidth computation that generate orderings of vertices with O(Delta) width. We can thus generate the cube representation of such graphs in O(Delta) dimensions in polynomial time.

Item Type: Conference Paper
Additional Information: Copyright of this article belongs to Springer.
Keywords: Cubicity - bandwidth - intersection graphs - AT-free graphs - circular-arc graphs - cocomparability graphs
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 10 Mar 2010 09:16
Last Modified: 19 Sep 2010 05:56
URI: http://eprints.iisc.ernet.in/id/eprint/26088

Actions (login required)

View Item View Item