151 search results - page 3 / 31 » Derandomized Squaring of Graphs |
DM
2006
14 years 11 months ago
2006
A sparse anti-magic square is an n
111
click to vote
ENDM
2006
14 years 11 months ago
2006
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...
80
Voted
JCO
2006
14 years 11 months ago
2006
In this paper, we present a combinatorial theorem on labeling disjoint axis-parallel squares of edge length two using points. Given an arbitrary set of disjoint axis-parallel squar...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
JGT
2008
14 years 11 months ago
2008
The square G2 of a graph G is the graph with the same vertex set as G and with two vertices adjacent if their distance in G is at most 2. Thomassen showed that for a planar graph ...