3757 search results - page 360 / 752 » The overlap number of a graph |
275
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
228
click to vote
FOCS
2006
IEEE
16 years 24 days ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
200
click to vote
WINE
2005
Springer
16 years 7 days ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
201
click to vote
ECML
2004
Springer
16 years 4 days ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
182
click to vote
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...