85 search results - page 14 / 17 » New Streaming Algorithms for Counting Triangles in Graphs |
JSAC
2007
14 years 9 months ago
2007
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
FSTTCS
2006
Springer
15 years 1 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
100
click to vote
SAC
2003
ACM
15 years 2 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
74
Voted
MIDDLEWARE
2007
Springer
15 years 3 months ago
2007
Springer
Many wireless sensor network protocols are employing gossipbased message dissemination, where nodes probabilistically forward messages, to reduce message overhead. We are concerne...
FSE
2005
Springer
15 years 3 months ago
2005
Springer
T-functions were introduced by Klimov and Shamir in a series of papers during the last few years. They are of great interest for cryptography as they may provide some new building ...