75 search results - page 10 / 15 » Randomly Coloring Constant Degree Graphs |
SIAMDM
2008
14 years 11 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
87
Voted
SASO
2008
IEEE
15 years 6 months ago
2008
IEEE
Many real–world networks show a scale–free degree distribution, a structure that is known to be very stable in case of random failures. Unfortunately, the very same structure ...
NIPS
2007
15 years 1 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
107
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
GD
2004
Springer
15 years 5 months ago
2004
Springer
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...