376 search results - page 20 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
SIAMDM
2008
13 years 7 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
CSB
2003
IEEE
14 years 1 months ago
2003
IEEE
Physical map reconstruction in the presence of errors is a central problem in genetics of high computational complexity. A parallel genetic algorithm for a maximum likelihood esti...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
COST
2009
Springer
14 years 2 months ago
2009
Springer
We propose a matching algorithm secure against the wolf attack in one-to-one biometric authentications. Our proposal algorithm first executes a one-to-all comparison using a conve...