796 search results - page 48 / 160 » The Anonymous Subgraph Problem |
143
Voted
APPROX
2000
Springer
15 years 5 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
103
click to vote
GD
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
115
Voted
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
140
Voted
DMTCS
2010
14 years 10 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
WWW
2007
ACM
16 years 1 months ago
2007
ACM
In a social network, nodes correspond to people or other social entities, and edges correspond to social links between them. In an effort to preserve privacy, the practice of anon...