4 search results - page 1 / 1 » Minimal rankings and the arank number of a path |
DM
2006
13 years 4 months ago
2006
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
CSB
2005
IEEE
2005
IEEE
BioNavigation: Using Ontologies to Express Meaningful Navigational Queries Over Biological Resources
13 years 10 months ago
Exploiting the complex maze of publicly available Biological resources to implement scientific data collection pipelines poses a multitude of challenges to biologists in accurate...
IMCSIT
2010
13 years 2 months ago
2010
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...