1172 search results - page 127 / 235 » Path Algorithms on Regular Graphs |
125
Voted
ICPP
2009
IEEE
15 years 7 days ago
2009
IEEE
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
113
Voted
ISAAC
1995
Springer
15 years 6 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
147
click to vote
CIKM
2011
Springer
14 years 2 months ago
2011
Springer
A fundamental problem related to RDF query processing is selectivity estimation, which is crucial to query optimization for determining a join order of RDF triple patterns. In thi...
133
click to vote
ALGORITHMICA
2002
15 years 2 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
111
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
Multihop lightwave networks are becoming increasingly popular in optical networks. It is attractive to consider regular graphs as the logical topology for a multihop network, due t...