3268 search results - page 394 / 654 » The hub number of a graph |
190
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
193
click to vote
SAT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
192
click to vote
ICC
2007
IEEE
16 years 28 days ago
2007
IEEE
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
217
click to vote
ECCB
2005
IEEE
16 years 7 days ago
2005
IEEE
Many areas of modern biology are concerned with the management, storage, visualization, comparison, and analysis of networks. For instance, networks are used to model signal trans...
171
click to vote
XSYM
2004
Springer
15 years 12 months ago
2004
Springer
A key step in the optimization of declarative queries over XML data is estimating the selectivity of path expressions, i.e., the number of elements reached by a specific navigatio...