367 search results - page 16 / 74 » Set connectivity problems in undirected graphs and the direc... |
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
ACCV
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Diffusion Tensor Imaging (DTI) provides estimates of local directional information regarding paths of white matter tracts in the human brain. An important problem in DTI ...
DAM
2008
13 years 8 months ago
2008
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
FSTTCS
2008
Springer
13 years 9 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...