171 search results - page 30 / 35 » Algorithms for Single-Source Vertex Connectivity |
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
86
Voted
SIAMCOMP
1998
14 years 9 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
STOC
2010
ACM
15 years 1 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
CSE
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
109
click to vote
ESA
2003
Springer
15 years 2 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...