3008 search results - page 553 / 602 » Independence in connected graphs |
142
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
162
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
163
click to vote
GRAPHICSINTERFACE
2007
15 years 7 months ago
2007
Many visualizations use smoothly animated transitions to help the user interact with information structures. These transitions are intended to preserve perceptual constancy during...
176
click to vote
SIGCOMM
2010
ACM
15 years 6 months ago
2010
ACM
Data center networks encode locality and topology information into their server and switch addresses for performance and routing purposes. For this reason, the traditional address...
206
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...