1729 search results - page 241 / 346 » On Bounds for the k-Partitioning of Graphs |
199
click to vote
WAW
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
223
click to vote
WINE
2010
Springer
15 years 4 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
202
click to vote
AAIM
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
173
click to vote
CASES
2009
ACM
15 years 4 months ago
2009
ACM
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
169
click to vote
CORR
2009
Springer
15 years 4 months ago
2009
Springer
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...