829 search results - page 156 / 166 » Distance domination-critical graphs |
PAMI
2008
14 years 9 months ago
2008
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity meas...
CAI
2002
Springer
14 years 9 months ago
2002
Springer
In a localized routing algorithm, node A currently holding the message forwards it based on the location of itself, its neighboring nodes and destination. We propose to use depth ...
108
Voted
CLA
2007
14 years 11 months ago
2007
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
70
Voted
BMCBI
2006
14 years 9 months ago
2006
Background: With the advent of high-throughput proteomic experiments such as arrays of purified proteins comes the need to analyse sets of proteins as an ensemble, as opposed to t...
SODA
2003
ACM
14 years 10 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...