On Connectivity and Realizability of Triangle Cover Contact Graphs
Speaker: Md. Saidur Rahman – Dhaka, BangladeshTopic(s): Computational Theory, Algorithms and Mathematics
Abstract
Let S = {p1, p2, . . . , pn} be a set of pairwise disjoint geometric objects of some type in a 2D plane and let C = {c1, c2, . . . , cn} be a set of closed objects of some type in the same plane with the property that each element in C covers exactly one element in S and any two elements in C are interior-disjoint. We call an element in S a seed and an element in C a cover. A cover contact graph (CCG) has a vertex for each element of C and an edge between two vertices whenever the orresponding cover elements touch. Cover contact graphs have applications in VLSI layout, broadcast networks and in cartograms. In respect to cover contact graphs, “connectivity problems” and “realization problems” are studied by several researchers. In a connectivty problem it is asked to cover a given set of seeds by a set of covers such that the the resulting cover contact graph becomes k-connected. On the other hand in a realization problem we are given a graph G of n vertices and a set of n seeds and we are asked to determine whether there is any covering such that the resulting cover contact graph is G. It is known how to construct, for any given point seed set, a disk or triangle cover whose contact graph is 1- or 2-connected. The realization problem in general is known as NP-hard. In this talk I will present some of our recent results on triangle cover contact graphs and discuss some open problems. The talk is based on my joint works with Shaheena Sultana.About this Lecture
Number of Slides: 70Duration: 45 minutes
Languages Available: English
Last Updated:
Request this Lecture
To request this particular lecture, please complete this online form.
Request a Tour
To request a tour with this speaker, please complete this online form.
All requests will be sent to ACM headquarters for review.