Skip to main content
Applied Network Science

Table 4 Effect of coloring/hard constraints

From: A family of tractable graph metrics

k

∥P∥0

∥ AP − PA ∥0

Ï„

1

3,747,960

100.569

133s

2

239,048

3004

104s

3

182,474

2036

136s

4

182,016

2030

169s

5

182,006

2030

200s

  1. Effect of coloring/hard constraints on the numbers of variables (∥P∥0) and terms of objective (∥AP−PA∥0) using k iterations of the WL coloring algorithm. The last column shows the execution time of WL on a 40 CPU machine using Apache Spark (Zaharia et al. 2010)
Back to article page