617 search results - page 91 / 124 » On the Chromatic Number of Random Graphs |
182
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
148
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
161
click to vote
IM
2007
15 years 4 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
152
click to vote
RECOMB
2007
Springer
16 years 4 months ago
2007
Springer
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
120
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...