1629 search results - page 107 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
PDCAT
2007
Springer
15 years 4 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
ESA
2010
Springer
14 years 11 months ago
2010
Springer
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...
EENERGY
2010
14 years 11 months ago
2010
Energy efficient networks are becoming a hot research topic, and the networking community is increasingly devoting its attention to the identification of approaches to save energy...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
IDEAL
2010
Springer
14 years 8 months ago
2010
Springer
World Wide Web (WWW) is a vast source of information, the problem of information overload is more acute than ever. Due to noise in WWW, it is becoming hard to find usable informati...