1949 search results - page 176 / 390 » Random graphs on surfaces |
232
click to vote
WAOA
2010
Springer
15 years 2 months ago
2010
Springer
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
123
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
134
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
124
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
160
click to vote
ALGORITHMICA
2011
14 years 11 months ago
2011
We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active ve...