1538 search results - page 122 / 308 » Spectral Techniques in Graph Algorithms |
101
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Many applications, including provenance and some analyses of social networks, require path-based queries over graphstructured data. When these graphs contain sensitive information...
128
click to vote
EDBT
2012
ACM
13 years 3 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
132
click to vote
GD
1998
Springer
15 years 5 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
137
click to vote
SOCIALCOM
2010
14 years 11 months ago
2010
A representation of the World Wide Web as a directed graph, with vertices representing web pages and edges representing hypertext links, underpins the algorithms used by web search...
121
click to vote
STOC
2003
ACM
16 years 1 months ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...