2310 search results - page 342 / 462 » Coloring Random Graphs |
WINE
2007
Springer
14 years 2 months ago
2007
Springer
We study the frugality ratio of truthful mechanisms in path auctions, which measures the extent to which truthful mechanisms “overpay” compared to non-truthful mechanisms. In p...
VALUETOOLS
2006
ACM
14 years 1 months ago
2006
ACM
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a mathematical model to analyse the establishment and maintenance of communication between mobile agents. We assume that the agents move through a fixed envir...
ISCAS
2003
IEEE
14 years 1 months ago
2003
IEEE
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
ISAAC
2000
Springer
13 years 11 months ago
2000
Springer
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...