882 search results - page 123 / 177 » On the Hardness of Graph Isomorphism |
IJCAI
2003
13 years 10 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
GMP
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract. Riemann surfaces naturally appear in the analysis of complex functions that are branched over the complex plane. However, they usually possess a complicated topology and ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
: Network intrusion detection systems are themselves becoming targets of attackers. Alert flood attacks may be used to conceal malicious activity by hiding it among a deluge of fa...
TKDE
2008
13 years 8 months ago
2008
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
ATMOS
2010
13 years 7 months ago
2010
Calculating timetables that are insensitive to disturbances has drawn considerable research efforts due to its practical importance on the one hand and its hard tractability by c...