Sciweavers

2294 search results - page 26 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
ALT
2010
Springer
14 years 6 months ago
PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
Balázs Csanád Csáji, Rapha&eu...
SIAMDM
1998
55views more  SIAMDM 1998»
14 years 11 months ago
Multiple Capacity Vehicle Routing on Paths
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
D. J. Guan, Xuding Zhu
96
Voted
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
15 years 1 months ago
Unconditionally reliable message transmission in directed networks
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...
ICHIT
2009
Springer
15 years 6 months ago
An efficient algorithm for AS path inferring
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...
Guoqiang Yang, Wenhua Dou
ICDE
2009
IEEE
149views Database» more  ICDE 2009»
16 years 1 months ago
OPAQUE: Protecting Path Privacy in Directions Search
Directions search returns the shortest path from a source to a destination on a road network. However, the search interests of users may be exposed to the service providers, thus r...
Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong, Baih...