1002 search results - page 17 / 201 » Towards Graph Programs for Graph Algorithms |
STACS
2010
Springer
15 years 6 months ago
2010
Springer
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
100
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
ENTCS
2008
14 years 12 months ago
2008
We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite `creation chains&#...
104
click to vote
CIKM
2011
Springer
13 years 11 months ago
2011
Springer
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
173
click to vote
ICDCN
2011
Springer
14 years 3 months ago
2011
Springer
Distributed processing of real-world graphs is challenging due to their size and the inherent irregular structure of graph computations. We present HIPG, a distributed framework th...