1363 search results - page 148 / 273 » The road coloring problem |
138
click to vote
CANS
2008
Springer
15 years 8 months ago
2008
Springer
In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , x...
140
click to vote
EJC
2006
15 years 6 months ago
2006
The problem of counting plane trees with n edges and an even or an odd number of leaves has been recently studied by Eu, Liu and Yeh, in connection with an identity on coloring ne...
167
click to vote
DM
2007
15 years 6 months ago
2007
In this paper, we address the problem of λ labelings, that was introduced in the context of frequency assignment for telecommunication networks. In this model, stations within a ...
149
click to vote
FCT
2005
Springer
15 years 12 months ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
157
click to vote
IADIS
2003
15 years 7 months ago
2003
This paper presents an innovative approach that deals with two specific problems encountered in the E-Government domain. The first problem is the cultural gap between laws and reg...