223 search results - page 41 / 45 » A Note on Graph Pebbling |
IPL
1998
13 years 7 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
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...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
ICALP
2001
Springer
14 years 2 days ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
DIAGRAMS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We review the use of diagrams in the UK National School Curriculum (NC) and assess it in the light of current research on childrens' graph comprehension. It is noted...