4913 search results - page 239 / 983 » Results and Perspectives of the G |
148
click to vote
COMPUTING
2004
15 years 6 months ago
2004
In this paper we propose a new stabilized three-field formulation applied to the advection-diffusion equation. Using finite elements with SUPG stabilization in the interior of the...
193
click to vote
DM
2002
15 years 6 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
188
click to vote
ENDM
2002
15 years 6 months ago
2002
Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in s...
159
Voted
PRESENCE
2007
15 years 6 months ago
2007
We describe a method for calibrating an electromagnetic motion tracking device. Algorithms for correcting both location and orientation data are presented. In particular we use a ...
158
click to vote
JCT
2010
15 years 5 months ago
2010
We show that for each η > 0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d+ 1 ≤ · · · ≤ d+ n and d− 1 ≤ · · · â...