Computing Well-Structured Subgraphs in Geometric Intersection Graphs

Date of Submission

July 2021

Date of Award

7-1-2022

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Doctoral Thesis

Degree Name

Doctor of Philosophy

Subject Name

Computer Science

Department

Advance Computing and Microelectronics Unit (ACMU-Kolkata)

Supervisor

Roy, Sasanka (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

For a set of geometric objects, the associative geometric intersection graph is the graph with a vertex for each object and an edge between two vertices if and only if the corresponding objects intersect. Geometric intersection graphs are very important due to their theoretical properties and applicability. Based on the different geometric objects, several types of geometric intersection graphs are defined. Given a graph G, an induced (either vertex or edge) subgraph H µG is said to be an well-structured subgraph if H satisfies certain properties among the vertices in H. This thesis studies some well-structured subgraphs finding problems on various geometric intersection graphs. We mainly focus on computational aspects of the problems. In each problem, either we obtain polynomial-time exact algorithm or show NP-hardness. In some cases, we also extend our study to design efficient approximation algorithms and fixed-parameter tractable algorithms. We study the construction of the planar Manhattan network (between every pair of nodes there is a minimum-length rectilinear path) of linear size for a given convex point set. We consider the maximum bipartite subgraph problem, where given a set S of n geometric objects in the plane, we want to compute a maximum-size subset S0 µ S such that the intersection graph of the objects in S0 is bipartite. We consider a variation of stabbing (hitting), dominating, and independent set problems on intersection graphs of bounded faces of a planar subdivision induced by a set of axis-parallel line segments in the plane. We investigate the problem of finding a maximum cardinality uniquely restricted matching (having no other matching that matches the same set of vertices) in proper interval graphs and bipartite permutation graphs. Finally, we consider the balanced connected subgraph problem on red-blue graphs (the color of each vertex is either red or blue). Here the goal is to find a maximum-sized induced connected subgraph that contains the same number of red and blue vertices

Comments

ProQuest Collection ID: https://www.proquest.com/pqdtlocal1010185/dissertations/fromDatabasesLayer?accountid=27563

Control Number

ISILib-TH510

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

DOI

http://dspace.isical.ac.in:8080/jspui/handle/10263/2146

Link to Full Text

Share

COinS