58 search results - page 12 / 12 » Collective Tree Spanners in Graphs with Bounded Parameters |
ACID
2006
13 years 9 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
SDM
2012
SIAM
11 years 10 months ago
2012
SIAM
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
ECCC
2006
13 years 7 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...