Sciweavers

949 search results - page 49 / 190
» exact 2008
Sort
View
DM
2008
58views more  DM 2008»
14 years 10 months ago
The vertex isoperimetric problem for the powers of the diamond graph
We introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has nested solutions. This is the fourth kind of graphs with this property besides the wel...
Sergei L. Bezrukov, Miquel Rius, Oriol Serra
ENTCS
2008
66views more  ENTCS 2008»
14 years 10 months ago
Measuring and Evaluating Parallel State-Space Exploration Algorithms
We argue in this paper that benchmarking should be complemented by direct measurement of parallelisation overheads when evaluating parallel state-space exploration algorithms. Thi...
Jonathan Ezekiel, Gerald Lüttgen
CPHYSICS
2006
68views more  CPHYSICS 2006»
14 years 10 months ago
Hyperfine structure parametrisation in Maple
In hyperfine structure examinations, routine high resolution spectroscopy methods have to be combined with exact fine structure calculations. The so-called magnetic A and electric...
Gediminas Gaigalas, O. Scharf, S. Fritzsche
DAM
2006
172views more  DAM 2006»
14 years 10 months ago
A Branch-and-Cut algorithm for graph coloring
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
Isabel Méndez-Díaz, Paula Zabala
DAM
2006
63views more  DAM 2006»
14 years 10 months ago
A novel use of t-packings to construct d-disjunct matrices
A t-packing is an ordered pair (V, P) where V is a v-set and P is a collection of k-subsets (blocks) of V such that each t-subset of V occurs in at most one block of P. If each t-...
Hung-Lin Fu, Frank K. Hwang