754 search results - page 142 / 151 » Exact Algorithms for the Vertex Separator Problem in Graphs |
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
DAC
2006
ACM
14 years 9 months ago
2006
ACM
Steiner routing is a fundamental yet NP-hard problem in VLSI design and other research fields. In this paper, we propose to model the routing graph by an RC network with routing t...
CHI
2008
ACM
14 years 8 months ago
2008
ACM
Collaborative filtering (CF) has been successfully deployed over the years to compute predictions on items based on a user's correlation with a set of peers. The black-box na...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...