4865 search results - page 176 / 973 » The Complexity of Graph Connectivity |
103
click to vote
IPL
2007
15 years 3 months ago
2007
The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum diameter of an induced subgraph by deleting at most k − 1 vertices from G. This paper considers the fa...
125
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: Prediction of disulfide bridges from protein sequences is useful for characterizing structural and functional properties of proteins. Several methods based on differen...
107
Voted
DAGM
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We present a hierarchical partitioning of images using a pairwise similarity function on a graph-based representation of an image. This function measures the difference ...
120
Voted
IMAGING
2003
15 years 4 months ago
2003
The use of an Interim Connection Space (ICS) is proposed as a means for extending the concept of device independent color management to support spectral imaging. Color management,...
114
Voted
TIP
2008
15 years 3 months ago
2008
This paper presents a connected coherence tree algorithm (CCTA) for image segmentation with no prior knowledge. It aims to find regions of semantic coherence based on the proposed ...