Sciweavers

3415 search results - page 91 / 683
» Lower Bounds for Kernelizations
Sort
View
ARSCOM
2007
76views more  ARSCOM 2007»
15 years 4 months ago
A New Lower Bound for A(17, 6, 6)
We construct a record-breaking binary code of length 17, minimal distance 6, constant weight 6, and containing 113 codewords.
Yeow Meng Chee
CORR
2008
Springer
132views Education» more  CORR 2008»
15 years 4 months ago
Betweenness Centrality : Algorithms and Lower Bounds
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
Shiva Kintali
DCG
2010
84views more  DCG 2010»
15 years 4 months ago
Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
Yefim Dinitz, Michael Elkin, Shay Solomon
DCG
2010
93views more  DCG 2010»
15 years 4 months ago
General Lower Bounds for the Minor Crossing Number of Graphs
Drago Bokal, Éva Czabarka, Lászl&oac...