2079 search results - page 299 / 416 » Universality of random graphs |
124
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
137
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
156
click to vote
WINE
2009
Springer
15 years 11 months ago
2009
Springer
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
148
click to vote
AICCSA
2007
IEEE
15 years 10 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
171
click to vote
NAR
2002
15 years 4 months ago
2002
The Kyoto Encyclopedia of Genes and Genomes (KEGG) is the primary database resource of the Japanese GenomeNet service (http://www.genome.ad.jp/) for understanding higher order fun...