376 search results - page 50 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
COCOON
1999
Springer
13 years 12 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
PUK
2000
13 years 9 months ago
2000
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
JCB
2008
13 years 7 months ago
2008
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
PODS
1999
ACM
14 years 19 hour ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...