12459 search results - page 89 / 2492 » cans 2006 |
EUMAS
2006
13 years 10 months ago
2006
We introduce a new type of combinatorial auction that allows agents to bid for goods to buy, for goods to sell, and for transformations of goods. One such transformation can be se...
COMBINATORICS
2006
13 years 9 months ago
2006
It is proved that, if G is a K4-minor-free graph with maximum degree 3, then G is totally 4-choosable; that is, if every element (vertex or edge) of G is assigned a list of 4 colo...
COMBINATORICS
2006
13 years 9 months ago
2006
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...
ECEASST
2006
13 years 9 months ago
2006
Graph programs allow a visual description of programs on graphs and graph-like structures. The correctness of a graph program with respect to a pre- and a postcondition can be show...
FGCS
2006
13 years 9 months ago
2006
Host configuration in optical networks is usually done by hand. In this paper we propose to use zero configuration techniques, including self-assigned IP addresses and multicast D...