3008 search results - page 46 / 602 » Independence in connected graphs |
152
click to vote
VC
2002
15 years 5 months ago
2002
The recent transition from meshing the whole model towards the independent meshing of the assembly parts introduced new challenges also in the task of visualizing and pre-processi...
135
click to vote
JCT
2008
15 years 6 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
157
click to vote
NSDI
2007
15 years 8 months ago
2007
Many studies show that, when Internet links go up or down, the dynamics of BGP may cause several minutes of packet loss. The loss occurs even when multiple paths between the sende...
152
click to vote
DM
2008
15 years 5 months ago
2008
A graph G is hamiltonian-connected if any two of its vertices are connected by a Hamilton path (a path including every vertex of G); and G is s-hamiltonian-connected if the deleti...
131
click to vote
IJCNN
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper deals with the more recent results obtained by the application of the CSLU Toolkit frame-based hybrid HMM/ANN architecture on the connected digit recognition task for t...