2310 search results - page 201 / 462 » Coloring Random Graphs |
111
click to vote
ICDM
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
163
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
184
Voted
FOCS
1993
IEEE
15 years 6 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
116
click to vote
LATIN
2004
Springer
15 years 7 months ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
120
click to vote
FSTTCS
2006
Springer
15 years 6 months ago
2006
Springer
Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and columns are less than one is a classical problem. It has been applied to hypergraph co...