649 search results - page 51 / 130 » A Graph Pebbling Algorithm on Weighted Graphs |
131
Voted
ATMOS
2007
15 years 4 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
119
click to vote
UAI
2003
15 years 3 months ago
2003
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
140
Voted
CLUSTER
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
157
Voted
SWAT
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
138
Voted
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...