45 search results - page 3 / 9 » sirocco 2007 |
SIROCCO
2007
14 years 11 months ago
2007
SIROCCO
2003
14 years 11 months ago
2003
SIROCCO
2000
14 years 11 months ago
2000
A graph with n vertices and maximum degree cannot be given weak sense of direction using less than colours. It is known that n colours are always sufficient, but it has been conje...
SIROCCO
1997
14 years 11 months ago
1997
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual “probabilistic construction”. Also, the best k...
SIROCCO
2001
14 years 11 months ago
2001
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...