1871 search results - page 5 / 375 » The Ephemeral Pairing Problem |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
PPSN
2010
Springer
13 years 5 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
IPL
2006
13 years 7 months ago
2006
A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper vertex subset such that all its elements present the same outer neighborhood. Given two ...
WINE
2007
Springer
14 years 1 months ago
2007
Springer
DIAGRAMS
2004
Springer
14 years 23 days ago
2004
Springer
