1986 search results - page 118 / 398 » Path Separability of Graphs |
SMA
2003
ACM
14 years 2 months ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
EDBT
2006
ACM
14 years 9 months ago
2006
ACM
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
SSDBM
2005
IEEE
14 years 2 months ago
2005
IEEE
To discover knowledge or retrieve information from a relational database, a user often needs to find objects related to certain source objects. There are two main challenges in b...
SIROCCO
2001
13 years 10 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...