4865 search results - page 106 / 973 » The Complexity of Graph Connectivity |
COCOA
2008
Springer
14 years 5 days ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
DBA
2004
13 years 11 months ago
2004
This paper discusses how to extend the applicability of the recursive cascade update command of the Xplain query language. This command guarantees termination because cycle detect...
ISBI
2011
IEEE
13 years 2 months ago
2011
IEEE
The tensor-based morphometry (TBM) has been widely used in characterizing tissue volume difference between populations at voxel level. We present a novel computational framework f...
DNA
2006
Springer
14 years 2 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
IICS
2005
Springer
14 years 3 months ago
2005
Springer
We provide an approach to distribute the calculation of PageRank, by splitting the graph into its strongly connected components. As we prove, the global ranking may be calculated c...