AbstractIt is proved that computing the maximum diameter ratio (also known as the local density) of a graph is APX-complete. The related problem of finding a maximum subgraph of a fixed diameter d⩾1 is proved to be even harder to approximate
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a ...
International audienceThe densest $k$-subgraph problem is a generalization of the maximum clique pro...
© Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein; lic...
We consider a well studied generalization of the maximum clique problem which is defined as follows....
Computing the diameter of a graph, i.e. the largest distance, is a fundamental problem that is centr...
We consider a well studied generalization of the maximum clique problem which is defined as follows....
We study the problem of approximating the diameter D of an unweighted and undirected n-node graph in...
AbstractThe following problem arises in the study of interconnection networks: find graphs of given ...
AbstractWe present a reduction that allows us to establish completeness results for several approxim...
The diameter, radius and eccentricities are natural graph parameters. While these problems have been...
AbstractDetermining the diameter of a graph is a fundamental graph operation, yet no efficient (i.e....
AbstractWe consider the problem of finding a spanning tree with maximum number of leaves. A 2-approx...
AbstractIn this paper, we study two variants of the problem of adding edges to a graph so as to redu...
The min-diameter of a directed graph G is a measure of the largest distance between nodes. It is equ...
AbstractIn this paper, we first show that the Highest Degree Subgraph problem remains P-complete for...
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a ...
International audienceThe densest $k$-subgraph problem is a generalization of the maximum clique pro...
© Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein; lic...
We consider a well studied generalization of the maximum clique problem which is defined as follows....
Computing the diameter of a graph, i.e. the largest distance, is a fundamental problem that is centr...
We consider a well studied generalization of the maximum clique problem which is defined as follows....
We study the problem of approximating the diameter D of an unweighted and undirected n-node graph in...
AbstractThe following problem arises in the study of interconnection networks: find graphs of given ...
AbstractWe present a reduction that allows us to establish completeness results for several approxim...
The diameter, radius and eccentricities are natural graph parameters. While these problems have been...
AbstractDetermining the diameter of a graph is a fundamental graph operation, yet no efficient (i.e....
AbstractWe consider the problem of finding a spanning tree with maximum number of leaves. A 2-approx...
AbstractIn this paper, we study two variants of the problem of adding edges to a graph so as to redu...
The min-diameter of a directed graph G is a measure of the largest distance between nodes. It is equ...
AbstractIn this paper, we first show that the Highest Degree Subgraph problem remains P-complete for...
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a ...
International audienceThe densest $k$-subgraph problem is a generalization of the maximum clique pro...
© Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein; lic...
DOI
Add to ORKG