171 search results - page 34 / 35 » Algorithms for Single-Source Vertex Connectivity |
FCT
2003
Springer
15 years 2 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
88
Voted
PKDD
2010
Springer
14 years 7 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
RECOMB
2004
Springer
15 years 9 months ago
2004
Springer
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
ALGOSENSORS
2008
Springer
14 years 11 months ago
2008
Springer
With the current progress in robot technology and related areas, sophisticated moving and sensing capabilities are at hand to design robots capable of solving seemingly complex tas...
102
click to vote
TPDS
2002
14 years 9 months ago
2002
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is...