4865 search results - page 53 / 973 » The Complexity of Graph Connectivity |
STOC
2004
ACM
14 years 10 months ago
2004
ACM
ACCV
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Diffusion Tensor Imaging (DTI) provides estimates of local directional information regarding paths of white matter tracts in the human brain. An important problem in DTI ...
JCT
2008
13 years 10 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...
INFOCOM
2009
IEEE
14 years 4 months ago
2009
IEEE
We explore the problem of modeling Internet connectivity at the Autonomous System (AS) level and present an economically-principled dynamic model that reproduces key features of t...
COCOA
2008
Springer
13 years 12 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...