3678 search results - page 33 / 736 » On the Stable Paths Problem |
DAM
2000
13 years 9 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
IRI
2003
IEEE
14 years 3 months ago
2003
IEEE
— The AnyLog pattern models the core knowledge of any Log, as a written record. The Log finds extensive use in the computing industry. The pattern makes it easy to model differen...
SIGCOMM
2009
ACM
14 years 4 months ago
2009
ACM
Routing oscillation is highly detrimental. It can decrease performance and lead to a high level of update churn placing unnecessary workload on router the problem is distributed b...
TCS
2010
13 years 4 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
SAGT
2010
Springer
13 years 8 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...