1972 search results - page 26 / 395 » connection 2008 |
SIAMDM
2000
13 years 7 months ago
2000
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamil...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
IADIS
2003
13 years 8 months ago
2003
The potential software market for client-side mobile applications is strongly dependent upon the ability to rapidly migrate existing in-house software solutions, while maintaining...
JCT
2008
13 years 7 months ago
2008
The old well-known result of Chartrand, Kaugars and Lick [1] says that every k-connected graph G with minimum degree at least 3k/2 has a vertex v such that G - v is still k-connec...
NIPS
2008
13 years 8 months ago
2008
EEG connectivity measures could provide a new type of feature space for inferring a subject's intention in Brain-Computer Interfaces (BCIs). However, very little is known on ...