Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019Cataloged from PDF version of thesis.Includes bibliographical references (pages 63-64).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 ...
We study fundamental graph parameters such as the Diameter and Radius in directed graphs, when dista...
Thesis (Ph.D.)-University of KwaZulu-Natal, Westville, 2007.No abstract available
A proper edge-coloring of a graph is a coloring in which adjacent edges receive distinct colors. A p...
Some of the most fundamental and well-studied graph parameters are the Diameter (the largest shortes...
© Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, and Virginia Vassilevska Will...
Abstract: In this thesis we study and investigate bounds on distance measures in graphs and digraphs...
The diameter of an unweighted graph is the maximum pairwise distance among its connected vertices. I...
In this thesis, we consider the problem of computing approximations of extremal distances in undirec...
This thesis is about finding useful structures in a graph using fast algorithms, or showing that no ...
AbstractWe present a randomized algorithm of expected time complexity O(m23n23log43m + m log2m + n l...
Presented as part of the Workshop on Algorithms and Randomness on May 16, 2018 at 10:15 a.m. in the ...
Given a set of n colored points in some d-dimensional Euclidean space, a bichromatic closest (resp....
AbstractLet an integer s ⩾ 1 and a graph G be given. Let us denote by χs(G) the smallest integer χ f...
The min-diameter of a directed graph G is a measure of the largest distance between nodes. It is equ...
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a ...
We study fundamental graph parameters such as the Diameter and Radius in directed graphs, when dista...
Thesis (Ph.D.)-University of KwaZulu-Natal, Westville, 2007.No abstract available
A proper edge-coloring of a graph is a coloring in which adjacent edges receive distinct colors. A p...
Some of the most fundamental and well-studied graph parameters are the Diameter (the largest shortes...
© Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, and Virginia Vassilevska Will...
Abstract: In this thesis we study and investigate bounds on distance measures in graphs and digraphs...
The diameter of an unweighted graph is the maximum pairwise distance among its connected vertices. I...
In this thesis, we consider the problem of computing approximations of extremal distances in undirec...
This thesis is about finding useful structures in a graph using fast algorithms, or showing that no ...
AbstractWe present a randomized algorithm of expected time complexity O(m23n23log43m + m log2m + n l...
Presented as part of the Workshop on Algorithms and Randomness on May 16, 2018 at 10:15 a.m. in the ...
Given a set of n colored points in some d-dimensional Euclidean space, a bichromatic closest (resp....
AbstractLet an integer s ⩾ 1 and a graph G be given. Let us denote by χs(G) the smallest integer χ f...
The min-diameter of a directed graph G is a measure of the largest distance between nodes. It is equ...
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a ...
We study fundamental graph parameters such as the Diameter and Radius in directed graphs, when dista...
Thesis (Ph.D.)-University of KwaZulu-Natal, Westville, 2007.No abstract available
A proper edge-coloring of a graph is a coloring in which adjacent edges receive distinct colors. A p...