344 search results - page 28 / 69 » Random Walks on Colored Graphs |
SPAA
2000
ACM
14 years 2 days ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
With more than 250 million active users, Facebook (FB) is currently one of the most important online social networks. Our goal in this paper is to obtain a representative (unbiased...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
NIPS
2008
13 years 9 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...