882 search results - page 140 / 177 » On the Hardness of Graph Isomorphism |
135
click to vote
CTRSA
2007
Springer
15 years 12 months ago
2007
Springer
In 2002, Micali and Rivest raised an open problem as to whether directed transitive signatures exist or not. In 2003, Hohenberger formalized the necessary mathematical criteria for...
158
click to vote
PODC
2004
ACM
15 years 11 months ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
188
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
166
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
163
click to vote
MSWIM
2003
ACM
15 years 11 months ago
2003
ACM
An ad hoc network is formed by wireless mobile nodes (hosts) that operate as terminals as well as routers in the network, without any centralized administration. Research in ad ho...