Sciweavers

483 search results - page 52 / 97
» On perfectness of sums of graphs
Sort
View
ESA
2008
Springer
142views Algorithms» more  ESA 2008»
13 years 10 months ago
Edge Coloring and Decompositions of Weighted Graphs
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
Uriel Feige, Mohit Singh
CORR
2011
Springer
139views Education» more  CORR 2011»
13 years 14 days ago
Clustering Partially Observed Graphs via Convex Optimization
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
Ali Jalali, Yudong Chen, Sujay Sanghavi, Huan Xu
INFOCOM
2008
IEEE
14 years 3 months ago
Swarming on Optimized Graphs for n-Way Broadcast
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
Georgios Smaragdakis, Azer Bestavros, Nikolaos Lao...
ATAL
2011
Springer
12 years 8 months ago
A double oracle algorithm for zero-sum security games on graphs
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
Manish Jain, Dmytro Korzhyk, Ondrej Vanek, Vincent...
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
14 years 5 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...