AbstractIn this paper, we analyze parameter improvement under vertex fusion in a graph G. This is a setting in which a new graph G′ is obtained after identifying a subset of vertices of G in a single vertex. We are interested in distance parameters, in particular diameter, radius and eccentricity of a vertex v. We show that the corresponding problem is NP-Complete for the three parameters. We also find graph classes in which the problem can be solved in polynomial time
Given a graph G = (V,E) and an integer D ≥ 1, we consider the problem of augmenting G by the smalles...
In this thesis, we deal with bounds on distance measures, namely, degree distance, radius, diameter...
Let $G=(V,E)$ be an $n$-vertex connected graph of maximum degree $\Delta$. Given access to $V$ and a...
AbstractIn this paper, we analyze parameter improvement under vertex fusion in a graph G. This is a ...
Thesis (M.Sc.)-University of Natal, 1996.In this thesis we investigate how the modification of a gra...
Given a graph $G$=($V$,$E$), a positive integer $k$ and a positive integer $d$, we want find a subse...
We study fundamental graph parameters such as the Diameter and Radius in directed graphs, when dista...
Nous étudions plusieurs problèmes d amélioration de réseaux qui consistent à ajouter de nouvelles li...
GRAPH BURNING asks, given a graph G = (V, E) and an integer k, whether there exists (b(0), ...,b(k-1...
We show that the eccentricity of every vertex in an undirected graph on n vertices can be computed i...
The diameter, radius and eccentricities are natural graph parameters. While these problems have been...
We show that the eccentricity of every vertex in an undirected graph on n vertices can be computed i...
Given a graph G=(V,E) and a positive integer D, we consider the problem of finding a minimum number ...
In this thesis, we consider the problem of computing approximations of extremal distances in undirec...
We consider the problem of adding a fixed number of new edges to an undirected graph in order to min...
Given a graph G = (V,E) and an integer D ≥ 1, we consider the problem of augmenting G by the smalles...
In this thesis, we deal with bounds on distance measures, namely, degree distance, radius, diameter...
Let $G=(V,E)$ be an $n$-vertex connected graph of maximum degree $\Delta$. Given access to $V$ and a...
AbstractIn this paper, we analyze parameter improvement under vertex fusion in a graph G. This is a ...
Thesis (M.Sc.)-University of Natal, 1996.In this thesis we investigate how the modification of a gra...
Given a graph $G$=($V$,$E$), a positive integer $k$ and a positive integer $d$, we want find a subse...
We study fundamental graph parameters such as the Diameter and Radius in directed graphs, when dista...
Nous étudions plusieurs problèmes d amélioration de réseaux qui consistent à ajouter de nouvelles li...
GRAPH BURNING asks, given a graph G = (V, E) and an integer k, whether there exists (b(0), ...,b(k-1...
We show that the eccentricity of every vertex in an undirected graph on n vertices can be computed i...
The diameter, radius and eccentricities are natural graph parameters. While these problems have been...
We show that the eccentricity of every vertex in an undirected graph on n vertices can be computed i...
Given a graph G=(V,E) and a positive integer D, we consider the problem of finding a minimum number ...
In this thesis, we consider the problem of computing approximations of extremal distances in undirec...
We consider the problem of adding a fixed number of new edges to an undirected graph in order to min...
Given a graph G = (V,E) and an integer D ≥ 1, we consider the problem of augmenting G by the smalles...
In this thesis, we deal with bounds on distance measures, namely, degree distance, radius, diameter...
Let $G=(V,E)$ be an $n$-vertex connected graph of maximum degree $\Delta$. Given access to $V$ and a...
DOI
Add to ORKG