Tight estimation of bichromatic farthest pair in graphs and related problems
Name
1102049342-MIT.pdf
Size
3.85 MB
Format
Adobe PDF
Checksum (MD5)
de15f50cfe0cb43918795c57f636e9d0
Author(s)
Dalirrooyfard, Mina.
Advisor(s)
Virginia Vassilevska Williams.
Date Issued
2019
Publisher
Massachusetts Institute of Technology
Abstract
Diameter and Radius are two of the most fundamental and well-studied graph parameters, where the diameter of a graph is the largest shortest paths distance and the radius is the smallest distance for which a "center" node can reach all other nodes. The natural and important ST-variant considers two subsets S and T of the vertex set and lets the ST-diameter be the maximum distance between a node in S and a node in T, and the ST-radius be the minimum distance for a node of S to reach all nodes of T. The bichromatic variant is the special case in which S and T partition the vertex set. This thesis provides a comprehensive study of the approximability of ST and Bichromatic Diameter, Radius, and Eccentricities in graphs with and without directions and weights. This Thesis is a joint work with Nikhil Vyas, Nicole Wein and Virginia Vassilevska Williams.
Description
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 63-64).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
Persistent DSpace Link
