1972 search results - page 192 / 395 » connection 2008 |
191
click to vote
GC
2008
Springer
15 years 6 months ago
2008
Springer
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...
183
click to vote
IM
2008
15 years 6 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
172
click to vote
MCSS
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We give a further elaboration of the fundamental connections between Lax-Phillips scattering, conservative input/state/output linear systems and Sz.-Nagy-Foias model theo...
213
click to vote
COMCOM
2007
15 years 6 months ago
2007
In this paper we address the problem of constrained optimization (ILP formulation) and propose a set of heuristic algorithms for assigning light-trails [1–4,7,10] to WDM ring ne...
217
click to vote
CGF
2010
15 years 4 months ago
2010
A feature-oriented generic progressive lossless mesh coder (FOLProM) is proposed to encode triangular meshes with arbitrarily complex geometry and topology. In this work, a sequen...