2681 search results - page 107 / 537 » Problem F |
DM
2010
13 years 10 months ago
2010
Using a generalisation of Hamiltonian cycles to uniform hypergraphs due to Katona and Kierstead, we define a new notion of a Hamiltonian decomposition of a uniform hypergraph. We ...
IPL
2002
13 years 10 months ago
2002
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
CSUR
1999
13 years 10 months ago
1999
Algorithm Engineering is concerned with the design, analysis, implementation, tuning, debugging and experimental evaluation of computer programs for solving algorithmic problems. ...
IPL
2010
13 years 8 months ago
2010
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
SIAMNUM
2010
13 years 5 months ago
2010
We develop a mixed finite element method for elliptic problems on hexahedral grids that reduces to cell-centered finite differences. The paper is an extension of our earlier paper...