1542 search results - page 149 / 309 » The metamathematics of random graphs |
115
click to vote
FOCS
2000
IEEE
15 years 6 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...
ICASSP
2010
IEEE
15 years 2 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 ...
121
click to vote
ALT
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
100
Voted
FOCS
1994
IEEE
15 years 6 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
129
click to vote
SDM
2008
SIAM
15 years 3 months ago
2008
SIAM
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...