2294 search results - page 128 / 459 » From Path Graphs to Directed Path Graphs |
APBC
2003
14 years 11 months ago
2003
Databases contain a large amount of data about metabolic pathways, in particular about similar pathways in different species. Biologists are familiar with visual representations ...
WADS
2007
Springer
15 years 4 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
14 years 10 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by the recent ...
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...