Sciweavers

458 search results - page 22 / 92
» Totally magic graphs
Sort
View
DM
1998
62views more  DM 1998»
13 years 8 months ago
Bipartite subgraphs of integer weighted graphs
For every integer p > 0 let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large...
Noga Alon, Eran Halperin
PAMI
2010
103views more  PAMI 2010»
13 years 7 months ago
The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed Graph
—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distributi...
Amin Mantrach, Luh Yen, Jérôme Callut...
FSTTCS
2009
Springer
14 years 1 months ago
Bounded Size Graph Clustering with Applications to Stream Processing
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, De...
ICIP
2007
IEEE
14 years 10 months ago
Stream Authentication Based on Generlized Butterfly Graph
This paper proposes a stream authentication method based on the Generalized Butterfly Graph (GBG) framework. Compared with the original Butterfly graph, the proposed GBG graph sup...
Zhishou Zhang, John G. Apostolopoulos, Qibin Sun, ...
WWW
2008
ACM
14 years 9 months ago
Measuring extremal dependencies in web graphs
We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation. ...
Yana Volkovich, Nelly Litvak, Bert Zwart