422 search results - page 24 / 85 » Shortest paths between shortest paths and independent sets |
OTM
2010
Springer
13 years 5 months ago
2010
Springer
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
TON
2002
13 years 7 months ago
2002
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
CDC
2009
IEEE
13 years 5 months ago
2009
IEEE
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...
VLDB
2012
ACM
12 years 3 months ago
2012
ACM
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
APPT
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...