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

Template-Driven Rainbow Coloring of Proper Interval Graphs

Chandran, LS and Das, SK and Hell, P and Padinhatteeri, S and Pillai, RR (2021) Template-Driven Rainbow Coloring of Proper Interval Graphs. In: 7th International Conference on Algorithms and Discrete Applied Mathematics, 11-13 Feb 2021, Rupnagar, pp. 452-470.

Full text not available from this repository.
Official URL: https://doi.org/10.1007/978-3-030-67899-9_36


For efficient design of parallel algorithms on multiprocessor architectures with memory banks, simultaneous access to a specified subgraph of a graph data structure by multiple processors requires that the data items belonging to the subgraph reside in distinct memory banks. Such �conflict-free� access to parallel memory systems and other applied problems motivate the study of rainbow coloring of a graph, in which there is a fixed template T (or a family of templates), and one seeks to color the vertices of an input graph G with as few colors as possible, so that each copy of T in G is rainbow colored, i.e., has no two vertices the same color. In the above example, the data structure is modeled as the host graph G, and the specified subgraph as the template T. We call such coloring a template-driven rainbow coloring (or TR-coloring). For large data sets, it is also important to ensure that no memory bank (color) is overloaded, i.e., the coloring is as balanced as possible. Additionally, for fast access to data, it is desirable to quickly determine the address of a memory bank storing a data item. For arbitrary topology of G and T, finding an optimal and balanced TR-coloring is a challenging problem. This paper focuses on rainbow coloring of proper interval graphs (as hosts) for cycle templates. In particular, we present an O(k· | V| + | E| ) time algorithm to find a TR-coloring of a proper interval graph G with respect to k-length cycle template, Ck. Our algorithm produces a coloring that is (i) optimal, i.e., it uses minimum possible number of colors in any TR-coloring; (ii) balanced, i.e, the vertices are evenly distributed among the different color classes; and (iii) explicit, i.e., the color assigned to a vertex can be computed by a closed form formula in constant time. © 2021, Springer Nature Switzerland AG.

Item Type: Conference Paper
Publication: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher: Springer Science and Business Media Deutschland GmbH
Additional Information: The copyright for this article belongs to Springer Science and Business Media Deutschland GmbH
Keywords: Color; Coloring; Graph algorithms; Graph structures; Memory architecture, Arbitrary topology; Closed-form formulae; Efficient designs; Multi processor architecture; Multiple processors; Proper interval graphs; Rainbow colorings; Simultaneous access, Graph theory
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 21 Dec 2021 05:03
Last Modified: 21 Dec 2021 05:03
URI: http://eprints.iisc.ac.in/id/eprint/68221

Actions (login required)

View Item View Item