239 search results - page 23 / 48 » Hardness and algorithms for rainbow connection |
113
click to vote
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
113
click to vote
KDD
2009
ACM
16 years 8 days ago
2009
ACM
Social media such as blogs, Facebook, Flickr, etc., presents data in a network format rather than classical IID distribution. To address the interdependency among data instances, ...
OOPSLA
2004
Springer
15 years 5 months ago
2004
Springer
This paper introduces dynamic object colocation, an optimization to reduce copying costs in generational and other incremental garbage collectors by allocating connected objects t...
103
click to vote
SDM
2004
SIAM
15 years 1 months ago
2004
SIAM
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
109
click to vote
ATAL
2010
Springer
15 years 26 days ago
2010
Springer
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...