Sciweavers

3208 search results - page 297 / 642
» A Lower Bound for Primality
Sort
View
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
15 years 6 months ago
Computing the Greedy Spanner in Near-Quadratic Time
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil M...
APAL
2008
84views more  APAL 2008»
15 years 6 months ago
Resolution over linear equations and multilinear proofs
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
Ran Raz, Iddo Tzameret
164
Voted
CPC
2008
51views more  CPC 2008»
15 years 6 months ago
Winning Fast in Sparse Graph Construction Games
A Graph Construction Game is a Maker-Breaker game. Maker and Breaker take turns in choosing previously unoccupied edges of the complete graph KN . Maker's aim is to claim a c...
Ohad N. Feldheim, Michael Krivelevich
DM
2010
79views more  DM 2010»
15 years 6 months ago
Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality
Let G be a connected graph, suppose that v is a vertex of G, and denote the subgraph formed from G by deleting vertex v by G \ v. Denote the algebraic connectivities of G and G \ ...
Steve Kirkland
152
Voted
ENDM
2010
105views more  ENDM 2010»
15 years 6 months ago
Minimizing Expected Attacking Cost in Networks
A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attack...
Anis Gharbi, Mohamed Naceur Azaiez, Mohamed Kharbe...